Senior Java Developer

What does the @SpringBootApplication annotation do internally? (Learn)

@Bean vs @components (Learn)

How can we inject a regular POJO into ISC containers?

Explain String vs String Buffers vs String Builder. (Learn)

What are executors in Java? What are the types of executors? (Learn)

What is a countdown latch?

What are cyclic barriers?

You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair.

Each time, you can climb either one step or two steps.

You are supposed to return the number of distinct ways you can climb from the 0th step to the Nth step.

Note:

Note: Since the number of ways can be very large, return the answer modulo 1000000007.

Example :

N=3

We can climb one step at a time i.e. {(0, 1) ,(1, 2),(2,3)} or we can climb the first two-step and then one step i.e. {(0,2),(1, 3)} or we can climb first one step and then two step i.e. {(0,1), (1,3)}.