Loading Question...
Jobra
🐞Step 1 of Jobra:AI Debugging RoundsAI-based coding roundsReal-world codebasesAI-powered debugging
DSA+AIPreparing you for both.
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;
}
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...
Square Point IITG Online Assessment - Indian Institute of Technology, Guwahati
MediumMed•163 views
Squarepoint OA (SDE):
-
Palindrome Transformation (repeated)
-
VWAP Anomaly Alerting Description: You are given two arrays of size N: price (P) and quantity (Q), representing the trade
…
Access the full question
Unlock the full statement, examples, constraints, and solution guidance.
Ending preview
…
• 0 <= pod[i] <= 10^9 • 1 <= cost[i] <= 10^4
