Interview Problems

A repository containing some of the popular and challenging Algorithmic problems that you may face during an interview. Solution to the problems are written(mostly) in C++ and(a few) in Python.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Interview Problems

About

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 79 Commits
A Rat in a Maze problem.cpp		A Rat in a Maze problem.cpp
Activity Selection Problem.cpp		Activity Selection Problem.cpp
Are the two Binary Trees Isomorphic?.cpp		Are the two Binary Trees Isomorphic?.cpp
BFS in CPP.cpp		BFS in CPP.cpp
BSTInsert.cpp		BSTInsert.cpp
BottomViewofATree.cpp		BottomViewofATree.cpp
Boundary Traversal of a Tree.cpp		Boundary Traversal of a Tree.cpp
Burst Balloons to Maximise Profit.cpp		Burst Balloons to Maximise Profit.cpp
Calculating nCr.cpp		Calculating nCr.cpp
Check Mirror in an n-ary tree.cpp		Check Mirror in an n-ary tree.cpp
Check if BST.cpp		Check if BST.cpp
Check if the Tree is Symmetrical.cpp		Check if the Tree is Symmetrical.cpp
Coin Change to get Sum with minimum coins.cpp		Coin Change to get Sum with minimum coins.cpp
Connect nodes of a Binary at the Same Level.cpp		Connect nodes of a Binary at the Same Level.cpp
Construct an Expression Tree from postfix expression.cpp		Construct an Expression Tree from postfix expression.cpp
Convert Infix Expression to Postfix Expression.cpp		Convert Infix Expression to Postfix Expression.cpp
Convert a Binary Tree to BST.cpp		Convert a Binary Tree to BST.cpp
Create BST from it's post order traversal - Recursive.cpp		Create BST from it's post order traversal - Recursive.cpp
Delete the Middle Node of a Linked List in Single Traversal.cpp		Delete the Middle Node of a Linked List in Single Traversal.cpp
Detect Cycle in a directed graph.cpp		Detect Cycle in a directed graph.cpp
Detect Cycle in an Undirected Graph.cpp		Detect Cycle in an Undirected Graph.cpp
Detect Loop in a Linked List.cpp		Detect Loop in a Linked List.cpp
Diagonal Sum.cpp		Diagonal Sum.cpp
Diagonal traversal of a Binary Tree.cpp		Diagonal traversal of a Binary Tree.cpp
Difference Array.cpp		Difference Array.cpp
Distinct Transformations.cpp		Distinct Transformations.cpp
Egg Dropping Puzzle.cpp		Egg Dropping Puzzle.cpp
Expression Tree to value.cpp		Expression Tree to value.cpp
Fenwick Tree.cpp		Fenwick Tree.cpp
Find all subsets that sum up to a given sum.cpp		Find all subsets that sum up to a given sum.cpp
Find if the Linked List is a Palindrome.cpp		Find if the Linked List is a Palindrome.cpp
Find merge point of two Linked Lists.cpp		Find merge point of two Linked Lists.cpp
Find the Kth Smallest Prime Factor.cpp		Find the Kth Smallest Prime Factor.cpp
Find the Kth digit from right in a ^ b if a and b are both large.cpp		Find the Kth digit from right in a ^ b if a and b are both large.cpp
Find two Primes with given sum.cpp		Find two Primes with given sum.cpp
First Non Repeating character in a stream.cpp		First Non Repeating character in a stream.cpp
Flatten a Linked List.cpp		Flatten a Linked List.cpp
Floyd Warshall Algorith.cpp		Floyd Warshall Algorith.cpp
Get Minimum Element From Stack O(N) space and time.cpp		Get Minimum Element From Stack O(N) space and time.cpp
Graph and DFS in CPP.cpp		Graph and DFS in CPP.cpp
Graph_Representation_In_C.c		Graph_Representation_In_C.c
Huffman Coding.cpp		Huffman Coding.cpp
In Place Convert The Leaves of a Binary Tree to a Doubly Linked List.cpp		In Place Convert The Leaves of a Binary Tree to a Doubly Linked List.cpp
In Place Convert a Binary Tree to Doubly Linked List		In Place Convert a Binary Tree to Doubly Linked List
In Place Convert a Binary Tree to Sum Tree.cpp		In Place Convert a Binary Tree to Sum Tree.cpp
Inorder Successor.cpp		Inorder Successor.cpp
Inversion Count in an Array using Fenwick Tree.cpp		Inversion Count in an Array using Fenwick Tree.cpp
Is Binary Tree Foldable.cpp		Is Binary Tree Foldable.cpp
Iterative Tree Traversals.cpp		Iterative Tree Traversals.cpp
KMP.cpp		KMP.cpp
KadanesAlgorithm.cpp		KadanesAlgorithm.cpp
Knight Walk - Breadth First Search(Dijkstra).cpp		Knight Walk - Breadth First Search(Dijkstra).cpp
LCS of three strings.cpp		LCS of three strings.cpp
Largest Connected Area in a Boolean Matrix.cpp		Largest Connected Area in a Boolean Matrix.cpp
Largest Rectangular Area consisting of all 1s in a Matrix.cpp		Largest Rectangular Area consisting of all 1s in a Matrix.cpp
Largest Rectangular Area in a histogram.cpp		Largest Rectangular Area in a histogram.cpp
Largest Submatrix with all 1s.cpp		Largest Submatrix with all 1s.cpp
Largest element in every contiguous subarray of size K.cpp		Largest element in every contiguous subarray of size K.cpp
Left View of a Binary Tree.cpp		Left View of a Binary Tree.cpp
Left and Right Boundary of a Tree.cpp		Left and Right Boundary of a Tree.cpp
LevelOrderTraversalOfTreeWithoutQueue.cpp		LevelOrderTraversalOfTreeWithoutQueue.cpp
Longest Bitonic Subsequence.cpp		Longest Bitonic Subsequence.cpp
Longest Common Subsequence.cpp		Longest Common Subsequence.cpp
Longest Common Substring.cpp		Longest Common Substring.cpp
Longest Increasing Subsequence(LIS) - O(N.log(N)) - Binary Indexed Tree(Fenwick Tree).cpp		Longest Increasing Subsequence(LIS) - O(N.log(N)) - Binary Indexed Tree(Fenwick Tree).cpp
Longest Increasing Subsequence.cpp		Longest Increasing Subsequence.cpp
Longest Palindromic Prefix.cpp		Longest Palindromic Prefix.cpp
Longest Palindromic Subsequence.cpp		Longest Palindromic Subsequence.cpp
Longest Palindromic Substring.cpp		Longest Palindromic Substring.cpp
Longest Path(Diameter) in a Binary Tree.cpp		Longest Path(Diameter) in a Binary Tree.cpp
Lowest Common Ancestor in a Binary Tree.cpp		Lowest Common Ancestor in a Binary Tree.cpp
Manacher's Algorithm - Longest Palindromic Substring.cpp		Manacher's Algorithm - Longest Palindromic Substring.cpp
Max or Min sum for contiguous subarray of size K.cpp		Max or Min sum for contiguous subarray of size K.cpp
Maximum Bitonic Subarray.cpp		Maximum Bitonic Subarray.cpp
Minimum Edit Distance.cpp		Minimum Edit Distance.cpp
Minimum Insertions required to convert string into palindrome.cpp		Minimum Insertions required to convert string into palindrome.cpp
MutliSourceBFS\Dijkstra.cpp		MutliSourceBFS\Dijkstra.cpp
Nth Catlan Numbers.cpp		Nth Catlan Numbers.cpp
Number of steps required to reach the last cell in a matrix.cpp		Number of steps required to reach the last cell in a matrix.cpp
Optimal Strategy for Game Pick.cpp		Optimal Strategy for Game Pick.cpp
PollardRhoFactorisation.cpp		PollardRhoFactorisation.cpp
Prim's Algorithm.cpp		Prim's Algorithm.cpp
Print LIS.cpp		Print LIS.cpp
PrintLargestContigSumSubarray.cpp		PrintLargestContigSumSubarray.cpp
Queue using two Stacks.cpp		Queue using two Stacks.cpp
README.md		README.md
Remove duplicates from a Sorted Singly Linked List in Single Traversal.cpp		Remove duplicates from a Sorted Singly Linked List in Single Traversal.cpp
Reversal Algorithm to rotate an array by k elements in O(N) time an in-place.cpp		Reversal Algorithm to rotate an array by k elements in O(N) time an in-place.cpp
Reverse Level Order Traversal.cpp		Reverse Level Order Traversal.cpp
Reverse a Linked List in groups of given size.cpp		Reverse a Linked List in groups of given size.cpp
Right View of a Binary Tree.cpp		Right View of a Binary Tree.cpp
Segment Tree with Lazy Propagation.cpp		Segment Tree with Lazy Propagation.cpp
Segment_Tree_Range_Minimum_Query.cpp		Segment_Tree_Range_Minimum_Query.cpp
Segment_Tree_Range_Sum_Query.cpp		Segment_Tree_Range_Sum_Query.cpp
Serialize and Deserialize a Binary Tree.cpp		Serialize and Deserialize a Binary Tree.cpp
Spiral Level Order Traversal of a Tree.cpp		Spiral Level Order Traversal of a Tree.cpp
Stack using two Queues.cpp		Stack using two Queues.cpp
SubarrayWithGivenSum(AllElementsPositive).cpp		SubarrayWithGivenSum(AllElementsPositive).cpp
Subset Sum Divisible by m.cpp		Subset Sum Divisible by m.cpp
The Painter's Partition Problem.cpp		The Painter's Partition Problem.cpp

dmast3r/Interview-Problems

Folders and files

Latest commit

History

Repository files navigation

Interview Problems

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages