Code: – Given the value of a starting position and an ending position, you have to reach from start to end in a linear way, and you can move either to position immediate right to current position or two step right to the given position. You have the print all the possible path to reach from start to destination. (DP)

Question

Accepted Answer

Print all possible paths from start to end in a linear way, moving either one or two steps right.

Use dynamic programming to solve the problem
Create a 2D array to store the number of paths to each position
Start from the end position and work backwards
At each position, calculate the number of paths by summing the number of paths from the next two positions
Print all the paths by backtracking from the start position

Top Oracle Application Developer interview questions & answers

Popular interview questions of Application Developer

Top HR questions asked in Oracle Application Developer