Skip to content

Latest commit

 

History

History
110 lines (70 loc) · 3.3 KB

README.md

File metadata and controls

110 lines (70 loc) · 3.3 KB

Programming Questions for Interview Preparation

This repositories hosts various programming questions that one person should cover before applying for programming interviews. Programming (Data Structures and Algorithms) make the foundation of a good programmer, and only questions related to programming are asked (and not of a particular Specialization) while giving an interview in any good company. It is recommended to any IT specialist or beginner to go through these questions / algorithms thoroughly.

Following programming questions are present in this repository with near-best time complexities:

TREE QUESTIONS

  1. Char Count At Same Position As English Characters (CharCountAtSamePositionAsEnglishCharacters class)

  2. Count Words In String (CountWordsInString class)

  3. Dividing String In N Equal Parts (DividingStringInNEqualParts class)

  4. Longest Span Same Sum Two Binary Arrays (LongestSpanSameSumTwoBinaryArrays class)

  5. Second Most Frequent Char In String (SecondMostFreqCharInString class)

  6. Simple Binary Tree Example (robillo.binary_tree package)

  7. Linked List (Using Custom robillo.stack) Example (robillo.linked_list package)

  8. Queue using LinkedList (robillo.queue/Queue) and its implementation (robillo.queue/QueueTest)

  9. Level Order Traversal of a Binary Tree Iterative Solution (binary_tree_traversal/LevelOrderTreeTraversal)

  10. Pre-order Tree Traversal (robillo.binary_tree/PreorderTreeTraversal)

  11. In-order Tree Traversal (robillo.binary_tree/InorderTreeTraversal)

  12. Post-order Tree Traversal (robillo.binary_tree/PostOrderTreeTraversal)

  13. Number of half nodes in binary tree (robillo.binary_tree/HalfNodesBinaryTree)

  14. Number of leaves in binary tree (robillo.binary_tree/LeafNodesBinaryTree)

  15. Number of full nodes in a binary tree (robillo.binary_tree/FullNodesInBinaryTree)

  16. Number of nodes / Size of a binary tree (robillo.binary_tree/SizeOfBinaryTree)

  17. Replace Node with depth in a binary tree (robillo.binary_tree/ReplaceNodeWithDepthInBinaryTree)

  18. Print nodes at kth level from root (robillo.binary_tree/PrintNodesAtKthDistanceFromRoot)

  19. Sum of nodes at Kth level of a tree (robillo.binary_tree/SumOfNodesAtKthLevelOfTree)

  20. Level order traversal line by line (robillo.binary_tree/LevelOrderTraversalLineByLineOfTree)

  21. Delete leaf node with value X (robillo.binary_tree/DeleteLeafValueWithValueX)

  22. Sum of all nodes in a tree (robillo.binary_tree/SumOfAllNodesOfTree)

  23. Maximum and Minimum values in a tree (robillo.binary_tree/MaxAndMinValueInATree)

  24. Level with maximum number of nodes (robillo.binary_tree/LevelWithMaxNumberOfNodes)

DYNAMIC PROGRAMMING QUESTIONS

GREEDY PROGRAMMING QUESTIONS

GRAPH QUESTIONS

TRIE QUESTIONS

HASHING QUESTIONS

QUEUE QUESTIONS

STACK QUESTIONS

LINKED LISTS QUESTIONS

ARRAYS QUESTIONS

MATRIX QUESTIONS

  1. Search in a row wise and column wise sorted matrix (robillo.matrix.SearchInRowAndColumnwiseSortedMatrix)

  2. Print unique rows in a given boolean matrix (robillo.matrix.PrintUniqueRowsBooleanMatrix)

  3. Maximum size square sub-matrix with all 1s (robillo.matrix.MaxSizeSquareSubMatrixWithOnes)