F&A Diskussionen
Treasure chest for programmers!! 💎💎💎💎
323 Stimmen
192 Antworten
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 Stimmen
2 Antworten
Heute heiß
Need suggestions
0 Votes
Best code for creating games?
0 Votes
progaming
1 Votes
Java full stack
0 Votes
Anyone Learning Godot?
1 Votes
Duration of heart refilling
0 Votes
hello world i need help
1 Votes