Find the height of a tree, and then find the longest path in a tree.
Software Engineer Software Developer Interview Questions
419,736 software engineer software developer interview questions shared by candidates
You have 12 marbles, out of which only one is of different weight. You dont know if its less or more than the others. what is the lest number of weighings you have to make to find it.
Implement a class called AirMap that has two methods: 1. add_route(start, destination) - adds ONE WAY connecting flight from one airport to another 2. print_all_routes(start, destination) - prints all possible routes from start to destination Given the following routes, print all possible routes between the airport C and D: A -----> B B -----> A A -----> C C -----> A A -----> D D -----> A B -----> C C -----> B B -----> D D -----> B Expected Output: C,A,B,D C,A,D C,B,A,D C,B,D
A robot can move only left and down in nXn matrix. Have to get to the bottom right corner of matrix. Write algorithm to find the maximum number paths it can take.
Dynamic programming question. Given a list of non-overlapping (but intersecting) intervals {[0-2], [2-5], [6-10]} find the largest non-intersecting set with mamimum range. I.e in above | {[2-5], [6-10]} | > | {[0-2], [6-10]} |
Design an ID allocator which can allocate and de-allocate from a range of 1-1,000,000
you are building a website and how would you count the number of visitors for the past 5 min. Follow ups included exploring potential concurrency issues and how would you fix it.
Write a function that: given a 1 row 2^n column matrix containing integers 1 to 2^n, divide the matrix in two, and place the right half of the matrix below the left half. Repeat this process until the matrix is 2^n rows and 1 column and return the result.
What is the difference between a reference and a pointer?
Given list of revision numbers and build statuses (OK or FAILED). Example : { (10001,OK ) , (10002, OK) , (10003, FAILED) , (10004,FAILED) } Find number of revision where build has failed in first time.
Viewing 1651 - 1660 interview questions