Kamlesh had the best answer to the code-crunch on:
Given an array of integers where each element represents the max number of steps that can be made forward from that element.
You have to return the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, then we cannot move through that element.
Note: assuming all integers are non negative.
Example:
  Input : arr[] = {1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9}
  Output : 3 (1-> 3 -> 8 -> 9)
A candid conversation with Steve Bourdow revealed how the Drake Equation shapes our understanding of life beyond Earth, and our work.
Big cheers to Madhavan for acing the CMA exam!
His hard work and dedication make him a valuable part of our team, and we couldn’t be prouder!
We turned a typical Friday into a ‘Fri-yayyy’ with stretches, strikes, and slices! From stretching together to teaming up at the bowling alley, the day reminded us why fun and connection matter at work.
We’re happy to answer any questions you may have and help you determine which of our services best fit your needs.
We schedule a call at your convenienceÂ
We do a discovery & consulting meetingÂ
We prepare a proposalÂ
Tech partner bringing your ideas to life.
Our software teams in your organization.
Our PM and software teams building for you
24/7 Monitoring, maintenance & optimization of your tech
