Skip to content

sahilarora1995/BasicInterviewCodes

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

170 Commits
Arrays
Arrays
 
 
BackTracking
BackTracking
 
 
Bit Manipulation
Bit Manipulation
 
 
Codechef
Codechef
 
 
Divide and Conquer
Divide and Conquer
 
 
Dynamic Programming
Dynamic Programming
 
 
FileHandling
FileHandling
 
 
Graphs
Graphs
 
 
Leetcode
Leetcode
 
 
LinkedList
LinkedList
 
 
STL
STL
 
 
Strings
Strings
 
 
Trees
Trees
 
 
BitManipulation1- Checking overflow.cpp
BitManipulation1- Checking overflow.cpp
 
 
BitManipulation2- Checking if power of four.cpp
BitManipulation2- Checking if power of four.cpp
 
 
BitManipulation3- Calculate n%d.cpp
BitManipulation3- Calculate n%d.cpp
 
 
D&C1- Median of two sorted arrays of same size.cpp
D&C1- Median of two sorted arrays of same size.cpp
 
 
D&C2- Count Inversions in an Array.cpp
D&C2- Count Inversions in an Array.cpp
 
 
D&C3- Max and min in an array using minimum number of comparisons.cpp
D&C3- Max and min in an array using minimum number of comparisons.cpp
 
 
D&C4- Karatsuba Multiplication.cpp
D&C4- Karatsuba Multiplication.cpp
 
 
D&C5- Peak Element in an array.cpp
D&C5- Peak Element in an array.cpp
 
 
D&C6- Missing term in an AP.cpp
D&C6- Missing term in an AP.cpp
 
 
LinkedList1- Multiply 2 numbers given as LL.cpp
LinkedList1- Multiply 2 numbers given as LL.cpp
 
 
LinkedList2- Sort a LL of 0's 1's and 2's only.cpp
LinkedList2- Sort a LL of 0's 1's and 2's only.cpp
 
 
README.md
README.md
 
 
dp1- longest common substring.cpp
dp1- longest common substring.cpp
 
 
dp2- Maximum sqaure sub-matrix with all 1's.cpp
dp2- Maximum sqaure sub-matrix with all 1's.cpp
 
 
dp3- String interleaving.cpp
dp3- String interleaving.cpp
 
 
dp4- Max sum increasing sub sequence.cpp
dp4- Max sum increasing sub sequence.cpp
 
 
dp5- Box Stacking.cpp
dp5- Box Stacking.cpp
 
 
equilibrium.cpp
equilibrium.cpp
 
 
frequewncy.cpp
frequewncy.cpp
 
 
graph1- Checking whether is a bipartite or not.cpp
graph1- Checking whether is a bipartite or not.cpp
 
 
graph2- Detecting cycle in undirected Graph.cpp
graph2- Detecting cycle in undirected Graph.cpp
 
 
graph3- Detecting cycle in directed Graph.cpp
graph3- Detecting cycle in directed Graph.cpp
 
 
kadane_algo.cpp
kadane_algo.cpp
 
 
map1 - Basics of Map using STL.cpp
map1 - Basics of Map using STL.cpp
 
 
maximum_rectangularsum.cpp
maximum_rectangularsum.cpp
 
 
permutation.cpp
permutation.cpp
 
 
queue1 - Basics of Queue using STL.cpp
queue1 - Basics of Queue using STL.cpp
 
 
spiral_matrix.cpp
spiral_matrix.cpp
 
 
stack1 - Basics of stack using STL.cpp
stack1 - Basics of stack using STL.cpp
 
 
tree1-formation of a tree.cpp
tree1-formation of a tree.cpp
 
 
tree10 - Binary tree is a BST or NOT.cpp
tree10 - Binary tree is a BST or NOT.cpp
 
 
tree11 - Size of the binary tree.exe
tree11 - Size of the binary tree.exe
 
 
tree12- Binary tree is a sum tree or not.cpp
tree12- Binary tree is a sum tree or not.cpp
 
 
tree13 - Print all root to leafs paths.cpp
tree13 - Print all root to leafs paths.cpp
 
 
tree14 - Density of a binary tree.cpp
tree14 - Density of a binary tree.cpp
 
 
tree15 - Diameter of a binary tree.cpp
tree15 - Diameter of a binary tree.cpp
 
 
tree16- Print all nodes at k distsne from root.cpp
tree16- Print all nodes at k distsne from root.cpp
 
 
tree17 - Print the level of a binary tree.cpp
tree17 - Print the level of a binary tree.cpp
 
 
tree18 - Print all the leaf from left to right.cpp
tree18 - Print all the leaf from left to right.cpp
 
 
tree19- Vertical level order traversal.cpp
tree19- Vertical level order traversal.cpp
 
 
tree2-Sum of all nodes.cpp
tree2-Sum of all nodes.cpp
 
 
tree20 - Left side view of a binary tree.cpp
tree20 - Left side view of a binary tree.cpp
 
 
tree21- Right side of a binary tree.cpp
tree21- Right side of a binary tree.cpp
 
 
tree22 - Number of leaves in a binary tree.cpp
tree22 - Number of leaves in a binary tree.cpp
 
 
tree23- Number of non leaves nodes.cpp
tree23- Number of non leaves nodes.cpp
 
 
tree24- Number of full nodes in a binary tre.cpp
tree24- Number of full nodes in a binary tre.cpp
 
 
tree25- Topview of a binary tree.cpp
tree25- Topview of a binary tree.cpp
 
 
tree26- Bottom view of a binary tree.cpp
tree26- Bottom view of a binary tree.cpp
 
 
tree27-Checking whether two trees are mirror image of each other or not.cpp
tree27-Checking whether two trees are mirror image of each other or not.cpp
 
 
tree28- Print all K sum paths possible.cpp
tree28- Print all K sum paths possible.cpp
 
 
tree3-Delete all nodes of a binary tree.cpp
tree3-Delete all nodes of a binary tree.cpp
 
 
tree4- Check if two binary trees are idenrtical or not.cpp
tree4- Check if two binary trees are idenrtical or not.cpp
 
 
tree5 - Lowest common ancestor in BST.cpp
tree5 - Lowest common ancestor in BST.cpp
 
 
tree6 - Lowest Common Ancestor in binary tree.cpp
tree6 - Lowest Common Ancestor in binary tree.cpp
 
 
tree7 - Height of the tree.cpp
tree7 - Height of the tree.cpp
 
 
tree8- Level order traversal of a Binary Tree.cpp
tree8- Level order traversal of a Binary Tree.cpp
 
 
tree9 - Reverse level order traversal.cpp
tree9 - Reverse level order traversal.cpp
 
 
triplet_sum.cpp
triplet_sum.cpp
 
 

Repository files navigation

BasicInterviewCodes

Basic Interview Codes of all big product based companies.

About

Basic Interview Codes of all big product based companies

Topics

microsoft amazon dynamic-programming trees divide-and-conquer bitmanipulation

Resources

Readme
Activity

Stars

8 stars

Watchers

2 watching

Forks

4 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages