iLabs Interview Report
- 0of 0 votes
AnswersGiven n length path (assume array with 0's and 1's), each step either a rock or acid bucket (0 is acid and 1 is rock), need to find the jumping pattern of the from to cross the given path. Conditions are:
- Andi November 10, 2012 in India
lets consider, curretly frog jumping at speed s, at each step
it can maintain same speed (s)
or increase by one step (s=s+1) or
decrease by one step (s=s-1);
find the jumping sequence for the given input.| Report Duplicate | Flag | PURGE
iLabs Software Engineer / Developer Algorithm - 0of 0 votes
Answerswrite a insert method for singly linked list, so that it will insert elements in the ascending order.
- Andi November 10, 2012 in India| Report Duplicate | Flag | PURGE
iLabs Software Engineer / Developer Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.