Find Largest 2
Find and fix the bug(s) in the code.
Constraints:
- 1 <= nums.length <= 100
- -1000 <= nums[i] <= 1000
Find Largest 2
Bugbash
Collection: January Collection
Bugbash: Issue 1
Bugbash - Debugging Challenge
Find and fix all the bugs in the code to complete this challenge. Your score is based on completion time and number of failed attempts.
35 developers participated
Average completion time:
701s
0/6 tasks
Qualification Challenge
Find and fix the bug(s) in the code below to qualify for this Bugbash challenge.