Return the head node of the singly linked list with each pair of nodes swapped. If there is a last odd node leave it in place. Example: Input: 1 -> 2 -> 3 -> 4 -> 5 Output: 2 -> 1 -> 4 -> 3 -> 5
Developer Big Data Interview Questions
730,671 developer big data interview questions shared by candidates
You are given a list of strings (e.g. ["cat", "dog", "hat", "apple", "c"] ). Write a program that would take as input a string containing a wild card character, like "*at", "**t" (could be "cat", "hat", "bat"), "ca*", etc. and return true if there is a corresponding string in the list, and false otherwise.
SQL : Top 3 Products by sale, % using Case, Basic Having clause and one Set operator (Intersect) type question Python : Average word length, ip-address parsing, dictionary, list of lists, flatten list of lists. ( Similar to previous interview experiences)
reverse bits of an integer that is a power of 2 , keeping complexity in mind.
Reverse the words in a sentence. For example, "Have a nice day" becomes "day nice a Have"
How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?
string compression: aaabbbbcc ->a3b4c2
You have two linked lists that merge at some node. The lists could be billions of nodes long. Find the node where the lists merge in the most optimal time while using a low amount of memory.
Given an integer array, write a program that returns an array with elements = product of the integers in input array except the one in its position. Ex: Given input: [2, 3, 10, 4, 5], output: [600, 400, 120, 300, 240] What is the complexity of your program? When will your program not work? Below is what I presented (O(n)), but it did not qualify me for the next round.
If a batsman given super powers so that he can hit any run[6,4 ,etc] and he wants to score highest run for himself , how he'll do that in 50 over game?
Viewing 721 - 730 interview questions