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.
-
Char Count At Same Position As English Characters (CharCountAtSamePositionAsEnglishCharacters class)
-
Count Words In String (CountWordsInString class)
-
Dividing String In N Equal Parts (DividingStringInNEqualParts class)
-
Longest Span Same Sum Two Binary Arrays (LongestSpanSameSumTwoBinaryArrays class)
-
Second Most Frequent Char In String (SecondMostFreqCharInString class)
-
Simple Binary Tree Example (robillo.binary_tree package)
-
Linked List (Using Custom robillo.stack) Example (robillo.linked_list package)
-
Queue using LinkedList (robillo.queue/Queue) and its implementation (robillo.queue/QueueTest)
-
Level Order Traversal of a Binary Tree Iterative Solution (binary_tree_traversal/LevelOrderTreeTraversal)
-
Pre-order Tree Traversal (robillo.binary_tree/PreorderTreeTraversal)
-
In-order Tree Traversal (robillo.binary_tree/InorderTreeTraversal)
-
Post-order Tree Traversal (robillo.binary_tree/PostOrderTreeTraversal)
-
Number of half nodes in binary tree (robillo.binary_tree/HalfNodesBinaryTree)
-
Number of leaves in binary tree (robillo.binary_tree/LeafNodesBinaryTree)
-
Number of full nodes in a binary tree (robillo.binary_tree/FullNodesInBinaryTree)
-
Number of nodes / Size of a binary tree (robillo.binary_tree/SizeOfBinaryTree)
-
Replace Node with depth in a binary tree (robillo.binary_tree/ReplaceNodeWithDepthInBinaryTree)
-
Print nodes at kth level from root (robillo.binary_tree/PrintNodesAtKthDistanceFromRoot)
-
Sum of nodes at Kth level of a tree (robillo.binary_tree/SumOfNodesAtKthLevelOfTree)
-
Level order traversal line by line (robillo.binary_tree/LevelOrderTraversalLineByLineOfTree)
-
Delete leaf node with value X (robillo.binary_tree/DeleteLeafValueWithValueX)
-
Sum of all nodes in a tree (robillo.binary_tree/SumOfAllNodesOfTree)
-
Maximum and Minimum values in a tree (robillo.binary_tree/MaxAndMinValueInATree)
-
Level with maximum number of nodes (robillo.binary_tree/LevelWithMaxNumberOfNodes)
-
Search in a row wise and column wise sorted matrix (robillo.matrix.SearchInRowAndColumnwiseSortedMatrix)
-
Print unique rows in a given boolean matrix (robillo.matrix.PrintUniqueRowsBooleanMatrix)
-
Maximum size square sub-matrix with all 1s (robillo.matrix.MaxSizeSquareSubMatrixWithOnes)