Jobra

HackerRank:LeetCode is dead.→Codinzhub:

🐞Step 1 of Jobra:AI Debugging RoundsAI-based coding roundsReal-world codebasesAI-powered debugging

DSA+AIPreparing you for both.Coming soon.

COMING SOON

JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp

// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}

A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition

Tap 'Let Jobra fix it' below to simulate AI debugging...

Loading Question...

Samsung Coding Practice Problems - 3 Hour Test Set 1 Online Assessment | Codinzhub

Jobra

HackerRank:LeetCode is dead.→Codinzhub:

🐞Step 1 of Jobra:AI Debugging RoundsAI-based coding roundsReal-world codebasesAI-powered debugging

DSA+AIPreparing you for both.Coming soon.

COMING SOON

JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp

// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}

A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition

Tap 'Let Jobra fix it' below to simulate AI debugging...

Samsung Coding Practice Problems - 3 Hour Test Set 1

Q1. 2D Mtrix - DTU SRI

Problem Statement

Given an N x N matrix containing numeric values and obstacles represented by 'x', find the maximum sum path

…

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

qt.push(d2);
                }
            }
        }
        cout<<"Case #"<<t<<endl;
        cout<<tml-1<<endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}

solution.cpp

Loading code editor...

Run code to see test results

00:00 / 69:42

Samsung Coding Practice Problems - 3 Hour Test Set 1

HardMed•856 views

Q1. 2D Mtrix - DTU SRI

Problem Statement

Given an N x N matrix containing numeric values and obstacles represented by 'x', find the maximum sum path

…

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

qt.push(d2);
                }
            }
        }
        cout<<"Case #"<<t<<endl;
        cout<<tml-1<<endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}

HardMed•856 views

Asked at

Published by Codinzhub

More from Samsung