Bar raiser 1. Given array of numbers, find a, b, c such that a + b = c. Can you beat O(N**2) ? 2. Difference between Quick sort and Merge sort. What modifications you make in Quick sort so that it provides O(N lg N) worst case complexity.
Software Development Engineer Interview Questions
33,172 software development engineer interview questions shared by candidates
Given a set of numbers, partition the set in to two, such that sum of all the candidates in first subset = sum of all the candidate numbers in second subset.
The questions in the first round were fairly straightforward if you use data structures like trees and linked lists for your work regularly. If you're working in areas where you don't use those data structures regularly, you may find the problems challenging. The question I was asked was "Given a sorted linked list, create a binary tree with the array with minimum height." Note that the question specified only binary tree and not binary search tree.
Basic algorithms and data structures questions.
"code a program that checks if a linked list is circular"
this was in online test..find gcd of an array of integers..
gray code, string
- How to determine if a given string is a combination of words in the dictionary. The given string does not have space at all. - Very complex questions about big O and improve algorithms
Signed NDA. Think LeetCode Easy/Medium.
Some sequencing questions in reasoning section.
Viewing 611 - 620 interview questions