Pancakes, size varies, and are put in a stack with random order. You have one operation called Flip(int[] pancakes, int k) to flip all pancakes from the top one to kth pancake, write a sort(int[] pancakes]) method
Software Engineer Data Interview Questions
438,723 software engineer data interview questions shared by candidates
Implementing a dictionary of quick searching words
given two linked lists with a digit in each node, add the two linked lists together. the result must be a linked list with one digit in each node. use only one iteration of the two input lists.
1. Calculate the factorial of an array of integers. 2. How to improve the factorial algorithm?
Are two words palindrome of each other?
What is a stack?
Why u chose IT? Why do want to join syntel?
Here is the brain teaser question: Given integers as 1, 2, 3, 4, ..., N. Every time you remove an alternative element until only one is left. If you reach the end, just do a rounding. Return the remaining element. For example, given 1,2,3,4,5,6, you remove 1, 3, 5 and then 2, 6. So the remaining element is 4. What is the remaining element if N is 2000?
Given a Binary Search Tree with integers at every node and an integer k, write code that decides whether or not there exists two nodes a and b such that a+b=k
The tech questions were easy if you had some practices (leetcode, etc). The behavior questions did catch me. Be prepared for some real QA scenario questions!
Viewing 481 - 490 interview questions