Write an algorithm to verify if a tree is a binary search tree.
Development Interview Questions
137,183 development interview questions shared by candidates
Create a data structure that minimizes time complexity of retrieving median and inserting new element. Getting median should be O(1) and insertion should be O(log(n)).
Divide two numbers without using / or % and return quotient.
The first technical round was not so tough,but it was informative.In the first round the questions were about MVC,C#,Sql,LIINQ,Entity Framework (Basic Questions). The second round was much about design patterns and how is your coding styles like SOLID principles.In the second round they gave me two phases(I think they were much concentrating about your coding styles like is your first phase is open for extension or not). They gave very less time period to complete second phase because they would like to test about architecture and coding styles.The questions were CRUD Operations for library without D.B.(30 min) and the next session was extending like admin and user roles and grouping books in Library(30 min).You are not allowed to bring mobiles in this round(internet). The third round was presentation round.You need to explain your code and they will be asking questions relative to your code. The fourth round was manager round.This will be taken by Rahul Shah (Managing Director).He is very nice person.This round is completely about you and your goals.What did you planned for that and why prowareness.Even though you performed well in all rounds but manager if you don't then you don't get offer.
Why not higher studies
Write a program to check if a number has rotational symmetry i.e is the same when rotated by 180 degrees. Ex 1691, 181, 11, 1001
General Questions about leadership principle, 3 coding questions and 1 system design question
First question was to find all numbers that occurred an odd-number of times in an array and second question was implement a stack that could return the largest number in the stack at anytime.
Given a string of Rs and Gs, design an algorithm to produce a string with Rs in the front and Gs after that. The number of flips from Rs to Gs or otherwise should be minimum. The number of Rs and Gs in the end need not be same as that in the beginning, however the length of the entire string should be the same.
Write a function that takes in an array and repeats an integer that appears the most.
Viewing 171 - 180 interview questions