Interview-Preparation-Codes

Classical Interview Problems

This Repo Contains All the Classical Interview Problems.

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
Buy And Sell Stock Series		Buy And Sell Stock Series
Count Of Subset sum		Count Of Subset sum
Decode Ways (Important)		Decode Ways (Important)
Dice Throw		Dice Throw
Longest Commom Subsequence(LCS)		Longest Commom Subsequence(LCS)
Longest Increasing Subsequence		Longest Increasing Subsequence
Longest Substring from a string		Longest Substring from a string
Maximum sum such that no two elements are adjacent		Maximum sum such that no two elements are adjacent
O-1 Knapsack		O-1 Knapsack
Partition Equal Subset Sum		Partition Equal Subset Sum
Reducing the number n Problems		Reducing the number n Problems
Remove K digits Question		Remove K digits Question
Stack Problem		Stack Problem
Stair Case problem (1D DP)		Stair Case problem (1D DP)
Stock Span Problem		Stock Span Problem
Subset with min difference		Subset with min difference
1411. Number of Ways to Paint N × 3 Grid.txt		1411. Number of Ways to Paint N × 3 Grid.txt
AMAZON QUESTION LIST 2020.txt		AMAZON QUESTION LIST 2020.txt
Catalan Number O(n^2) Appriach.txt		Catalan Number O(n^2) Appriach.txt
Minimum Steps to make number Zero using its digits.txt		Minimum Steps to make number Zero using its digits.txt
README.md		README.md
Subset Question FB.txt		Subset Question FB.txt

Provide feedback