# Senior Engineer Interview Questions

Senior engineer interview questions shared by candidates

## Top Interview Questions

You are given a fixed number of 5 rupee, 10 rupee, 20 rupee and 50 rupee stamps. Now given an amount for sending a parcel, you should design an algorithm to come out with the minimum number of stamps that should be used for attaining that amount. For example, if the parcel costed 30 rupees, it could be attained using one 20 rupee stamp and one 10 rupee stamp OR using three 10 rupee stamps OR using one 20 rupee stamp and two 5 rupee stamps OR using one 10 rupee stamp and four 5 rupee stamps OR using two 10 rupee stamps and two 5 rupee stamps. However, the minimum number of stamps is the case of one 20 rupee stamp and one 10 rupee stamp where only two stamps are used. The case where no solution is possible should also be handled, for example, a parcel amount of exactly 33 rupees cannot be attained. The solution is attained using dynamic programming. The basic idea is that the minimum number of stamps used for attaining an amount x, is 1+minimum of (minimum number of stamps for attaining x-5, minimum number of stamps for attaining x-10, minimum number of stamps for attaining x-20,minimum number of stamps for attaining x-50). You can try to solve this first by assuming that an unlimited number of 5 rupee, 10 rupee, 20 rupee and 50 rupee stamps are available. And then you can take into account that only a fixed number of these stamps are available. I understand what the interviewer is trying to test and I know how to solve it, but what about more realistic scenario where parcel postage cost would be beyond given values like 3 units of currency or 37 units of currency. In this specific case, dynamic programming is overkill. There's a better optimal substructure here: The stamp with greatest value less than parcel cost minus stamp values already committed minimize the total of stamps. Show more responses |

if there are 6 people in a team, how many handshakes will be there |

Classix 2 eggs problem . * You are given 2 eggs. * You have access to a 100-storey building. * Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100 th floor.Both eggs are identical. * You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking. * Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process |

Given the daily stock prices of a share during last 30 days, write a program to find out best buying and selling dates for maximum gain. The program should run with O(n) complexity. |

int func() { static int i = 4; i++; return i; } int main() { int i = 0; for (i = 0; i< 4; i++) { printf("%d\n", func()); } } |

Probability of a knight making a valid move on NxN matrix in m steps. |

Find 2 or more missing numbers in a set of 100 natural numbers |

Why do you want to join Lanco Infratech Ltd |

After Round 2 I Asked Interviewer How he would Solution for Above mentioned Q1 & Q2 questions of the Round 2 Technical Interview. Very Smartly Interviewer Did not take any effort to answer and also told me find it out by myself :) |

Reverse linked list recursively. |

**1**–

**10**of

**12,868**Interview Questions

## See Interview Questions for Similar Jobs

- Software Engineer
- Software Developer
- Java Developer
- Technical Lead
- Software Development Engineer
- Associate Software Engineer
- Consultant
- Software Development Engineer II
- Senior Consultant
- Project Manager
- Senior Software Developer
- Business Analyst
- Analyst
- Senior Engineer
- Associate
- Software Engineer II
- Applications Developer
- Senior Software Development Engineer
- Manager