DSA Day 73/100
Topic: Searching
Questions Successfully Completed: 1
1) Roof TopEasy
QuestionInput: N = 4 A[] = {1,2,3,4} Output: 3 Explanation: 1 to 2 to 3 to 4 is the jump of length 3 to have maximum number of buildings with increasing heights, so maximum steps w...
preetikaprakash.hashnode.dev1 min read