Interview questions

Software Developer interview questions – page 9

945 questions. Tap “Show answer” to check yourself.

  1. Write a program to traverse a linked list

  2. Write a program to reverse a linked list. ? how will you do it if you are allowed to use extra space?

  3. In a knockout football tournament, there are n teams. find total no. of matches to be played to choose the winner of the tournament

  4. Mongo DB, AngularJs, BreezeJs, Neo4j skills are very strong plus to have

  5. How to find a number in a rotated sorted array. He was looking for the binary search kind of solution?

  6. What do u want us to do fr u?

  7. What is a hash table? Explain how they work (hash function and buckets)?

  8. WAP to find a continuous subset whose sum is divisible by 7. We are given a array of number (-ve and +ve). calculate the complexity of your algorithm?

  9. Given a 2-dimensional array of integers, find the value 1 in the array, and set all those rows, and columns to 1, which contains one of the values as 1

  10. Write a program to check if a binary tree is balanced

  11. Given s string, Find max size of a sub-string, in which no duplicate chars present?

  12. A sentence is given which contains lowercase English letters and spaces. It may contain multiple spaces. Get first letter of every word and return the result as a string. The result should not contain any space

  13. Find Nth largest element in the BST

  14. Given a BST, find the node which contains the value which is equal to or greater than the input value?

  15. Given an array find any three numbers which sum to zero. Give the best algorithm?

  16. Given a BST, how would you return the kth smallest element. Cover all the corner cases with time complexity logn?

  17. Which is the fastet method to sort an almost sorted array: quick sort,bubble sort,merge sort,shell sort

  18. Tell about zombie process?

  19. Complexities on hash table?

  20. What is the complexity of retrieving min element from a max heap

  21. Write code to find sum of two numbers stored as linked list.(LSB at last node) and head of each list is given

  22. Write code to print elements on the path from root to leaf node having the maximum sum

  23. Given a number, compute the nearest palindrome number. This palindrome number should be greater than given number

  24. Given two string str and pat. Find minimum window in str which contains all characters from string pat

  25. Input : 4 jars and 50 balls of different colors (Red, Green, Yellow, Blue) where each jar can contain a maximum of 100 balls.Problem : When a user draws a red ball he loses his money while if he draws a ball of some other color his money is doubled. Arrange the balls in such a way that the user has highest probability to lose

  26. Given a large list of numbers in a file and a very small amount of memory, sort the file

  27. Implement a phone book. You can search either by name or phone number. You can search by prefix also. Write whole code with proper syntax

  28. Given an array of integers, find Pythagorean triplets. i.e. find a,b and c which satisfies a^2 + b^2 = c^2. Integers could be positive or negative

  29. Check whether given Binary Tree is a Binary Search Tree. Discuss various approaches?

  30. Given n sequences, and starting and stopping point of every sequence with its score. For eg. no of sequences = 5 start stop score 0 4 4 3 10 11 6 8 8 7 15 10 11 15 4 All scores are positive. You have to find the maximum subset of non overlapping sequences having maximum total sum of scores. I proposed a n^2 approach first and then modified it to nlgn

Companies that ask Software Developer questions