Q&A Discussions
Matt reaches the final round of a treasure hunt. In this, he finds that as he proceeds there are flags with the number written on them at different positions. The difference between two consecutive flags can be either a or b. If he finds the number on the first flag is 0. Given three integer, first one is number of flags present, second is a and third is b. then return all the possible values for last flag for each test case.
hunt({3 1 2}) = {2 3 4}
0 Votes
2 Answersso far in section 1 question 2 area all of the videos have been ads that if you skip the add it just brings up the questions you need to answer. also if you play the add all the way thru you get the same exact thing. luckily I'm using this as a refresher course but I would think if I didn't know anything about c++ then I could be pretty lost missing videos.
0 Votes
2 AnswersHot today
DSA doubt
1 Votes
Input errors (python)
1 Votes
Data structure using C
0 Votes
Vote Code
1 Votes
Without degree job
0 Votes