DSA - Nth Fibonacci no with memoization, Find duplicate node in Linked list, Binary tree DSA questions, Project based tech questions, OOPS, Puzzle

Question

Accepted Answer

Interview questions for Software Engineer position covering DSA, project-based tech questions, OOPS, and puzzle.

Be prepared to answer DSA questions such as finding the Nth Fibonacci number with memoization, finding duplicate nodes in a linked list, and binary tree DSA questions.
Expect project-based tech questions that may require you to explain your approach to solving a particular problem.
Brush up on OOPS concepts and be ready to apply them to real-world scenarios.
Be prepared to solve puzzles that test your problem-solving skills and creativity.

Accepted Answer

int solve(int n){
    if(n==0){
        return 0;
    }
    if(n==1){
        return 1;
    }
   int n1=0;int n2=1;int n3;
   for(int i =2;i<=n;i++){
       n3=n1+n2;
       n1=n2;n2=n3;
   }
   return n3;
}

Accepted Answer

C++ code:

int fibo(int n)

{

int f[n+2];

f[0] = 0;

f[1] = 1;

for (i = 2; i <= n; i++) {

f[i] = f[i - 1] + f[i - 2];

}

return f[n];

}

DSA - Nth Fibonacci no with memoization, Find duplicate node in Linked list, Binary tree DSA questions, Project based tech questions, OOPS, Puzzle

Incedo Software Engineer interview questions & answers

Popular interview questions of Software Engineer