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...
Apple Online Assessment MCQS - NIT On Campus PYQS
MediumMed•1,816 views
1. Tower of Hanoi
Question:
The recurrence for Tower of Hanoi with n disks is:
- A)
T(n) = T(n-1) + 2 - B)
…
Access the full question
Unlock the full statement, examples, constraints, and solution guidance.
Ending preview
…