GitHub - vishalku03/Mix_Dsa: we learn and solve all dsa concept problems . And inhance my concept like arrays , strings , Binary search , Binary tree , binary search tree , dynamic programming , graph, heap , bit manipulation and all other concept of dsa.r

all problems are leetcode and gfg

Name		Name	Last commit message	Last commit date
Latest commit History 114 Commits
ALL ELEMENTS IN TWO BINARY SEARCH TREE.cpp		ALL ELEMENTS IN TWO BINARY SEARCH TREE.cpp
AVERAGE OF LEVELS IN BINARY TREE.cpp		AVERAGE OF LEVELS IN BINARY TREE.cpp
BAGS OF TOKENS.cpp		BAGS OF TOKENS.cpp
BALANCE A BINARY SEARCH TREE.cpp		BALANCE A BINARY SEARCH TREE.cpp
BALANCE BINARY TREE.cpp		BALANCE BINARY TREE.cpp
BEST TIME TO BUY AND SELL STOCK .cpp		BEST TIME TO BUY AND SELL STOCK .cpp
BINARY SEARCH TREE TO GREATER SUM TREE.cpp		BINARY SEARCH TREE TO GREATER SUM TREE.cpp
BINARY TREE LEVEL ORDER TRAVERSAL.cpp		BINARY TREE LEVEL ORDER TRAVERSAL.cpp
BINARY TREE PATHS.cpp		BINARY TREE PATHS.cpp
BINARY TREE POSTORDER TRAVERSAL.cpp		BINARY TREE POSTORDER TRAVERSAL.cpp
BINARY TREE PREORDER TRAVERSAL.cpp		BINARY TREE PREORDER TRAVERSAL.cpp
BINARY TREE PRUNING.cpp		BINARY TREE PRUNING.cpp
CONSTRUCT A BINARY TREE FROM PREORDER AND INORDER TRAVERSAL.cpp		CONSTRUCT A BINARY TREE FROM PREORDER AND INORDER TRAVERSAL.cpp
CONSTRUCT A BINARY TREE FROM PREORDER TRAVERSAL .cpp		CONSTRUCT A BINARY TREE FROM PREORDER TRAVERSAL .cpp
CONTAINER WITH MOST WATER.cpp		CONTAINER WITH MOST WATER.cpp
CONTAINS DUPLICATE.cpp		CONTAINS DUPLICATE.cpp
CONVERT BST TO GREATER TREE.cpp		CONVERT BST TO GREATER TREE.cpp
DELETE NOTES AND RETURN FOREST.cpp		DELETE NOTES AND RETURN FOREST.cpp
DELETE NODE IN A BST.cpp		DELETE NODE IN A BST.cpp
DESTROYING ASTEROIDS.cpp		DESTROYING ASTEROIDS.cpp
DIAGONAL SUM IN A BINARY TREE.cpp		DIAGONAL SUM IN A BINARY TREE.cpp
DIAMETER OF BINARY TREE.cpp		DIAMETER OF BINARY TREE.cpp
FIND MISSING AND REPEATING VALUES.cpp		FIND MISSING AND REPEATING VALUES.cpp
FIND PAIR WITH SUM IN SORTED AND ROTATED ARRAY.cpp		FIND PAIR WITH SUM IN SORTED AND ROTATED ARRAY.cpp
GENERATE PARENTHESIS.cpp		GENERATE PARENTHESIS.cpp
INSERT INTO BINARY SEARCH TREE.cpp		INSERT INTO BINARY SEARCH TREE.cpp
INVERT BINARY TREE.cpp		INVERT BINARY TREE.cpp
KTH SMALLEST ELEMENT IN BST.cpp		KTH SMALLEST ELEMENT IN BST.cpp
Kth LARGEST ELEMENT IN AN ARRAY .cpp		Kth LARGEST ELEMENT IN AN ARRAY .cpp
LEAF SIMILAR TREES.cpp		LEAF SIMILAR TREES.cpp
LONGEST ZIG ZAG PATH IN A BINARY TREE.cpp		LONGEST ZIG ZAG PATH IN A BINARY TREE.cpp
LOWEST COMMON ANCESTOR IN A BINARY TREE.cpp		LOWEST COMMON ANCESTOR IN A BINARY TREE.cpp
LOWEST COMON ANCESTOR IN BST.cpp		LOWEST COMON ANCESTOR IN BST.cpp
MAKE SKEW TREE.cpp		MAKE SKEW TREE.cpp
MAXIMUM DEPTH OF BINARY TREE.cpp		MAXIMUM DEPTH OF BINARY TREE.cpp
MAXIMUM LEVEL SUM OF BINARY TREE.cpp		MAXIMUM LEVEL SUM OF BINARY TREE.cpp
MAXIMUM SUBARRAY.cpp		MAXIMUM SUBARRAY.cpp
MIN AND MAX IN ARRAY.cpp		MIN AND MAX IN ARRAY.cpp
MINIMIZE THE HEIGHT.cpp		MINIMIZE THE HEIGHT.cpp
MINIMUM DEPTH OF BINARY TREE.cpp		MINIMUM DEPTH OF BINARY TREE.cpp
MINIMUM DISTANCE BETWEEN BST NODES.cpp		MINIMUM DISTANCE BETWEEN BST NODES.cpp
MINIMUM OPERATION TO MAXIMIZE LAST ARRAY.cpp		MINIMUM OPERATION TO MAXIMIZE LAST ARRAY.cpp
MINIMUM SWAPS TO GROUP ALL 1'S TOGETHER2 .cpp		MINIMUM SWAPS TO GROUP ALL 1'S TOGETHER2 .cpp
NEXT PERMUTATION .cpp		NEXT PERMUTATION .cpp
PATH SUM .cpp		PATH SUM .cpp
PATH SUM 2 .cpp		PATH SUM 2 .cpp
README.md		README.md
RIGHT VIEW OF THE TREE.cpp		RIGHT VIEW OF THE TREE.cpp
SEARCH IN ROTATED AND SORTED ARRAY.cpp		SEARCH IN ROTATED AND SORTED ARRAY.cpp
SERIALIZE AND DESERILIZE BST.cpp		SERIALIZE AND DESERILIZE BST.cpp
SINGLY LL to BST.cpp		SINGLY LL to BST.cpp
SUM OF ROOT OF LEAF BINARY NUMBER.cpp		SUM OF ROOT OF LEAF BINARY NUMBER.cpp
SUM ROOT OF LEAF NUMBERS.cpp		SUM ROOT OF LEAF NUMBERS.cpp
SYMETRIC TREE.cpp		SYMETRIC TREE.cpp
TRAPING RAIN WATER.cpp		TRAPING RAIN WATER.cpp
TRIM A BINARY SEARCH TREE.cpp		TRIM A BINARY SEARCH TREE.cpp
UNIQUE BINARY SEARCH TREE.cpp		UNIQUE BINARY SEARCH TREE.cpp
VALIDATE BINARY SEARCH.cpp		VALIDATE BINARY SEARCH.cpp
add one row to tree.cpp		add one row to tree.cpp
add strings.cpp		add strings.cpp
backspace string comare.cpp		backspace string comare.cpp
best time to buy and shell stock four.cpp		best time to buy and shell stock four.cpp
bittu.cpp		bittu.cpp
boats to save people.cpp		boats to save people.cpp
candy.cpp		candy.cpp
compare versions number.cpp		compare versions number.cpp
demo.cpp		demo.cpp
diagonal diverse 2 .cpp		diagonal diverse 2 .cpp
distribute coins in binary tree.cpp		distribute coins in binary tree.cpp
excel sheet columnNumber.cpp		excel sheet columnNumber.cpp
excell sheet column title.cpp		excell sheet column title.cpp
expressions add operators.cpp		expressions add operators.cpp
find all group of farmland.cpp		find all group of farmland.cpp
find all number disappeared in an array.cpp		find all number disappeared in an array.cpp
find if path exits in graph.cpp		find if path exits in graph.cpp
find the common characters.cpp		find the common characters.cpp
find the maximum sum of the node value.cpp		find the maximum sum of the node value.cpp
find the safest path in the grid.cpp		find the safest path in the grid.cpp
first unique character in a string.cpp		first unique character in a string.cpp
freedom trial.cpp		freedom trial.cpp
happy number.cpp		happy number.cpp
insertion ao two aarays.cpp		insertion ao two aarays.cpp
is subsequence.cpp		is subsequence.cpp
island perimeter.cpp		island perimeter.cpp
kth smallest prime fraction.cpp		kth smallest prime fraction.cpp
letter combination of phone numbers.cpp		letter combination of phone numbers.cpp
longest ideal subsequencq.cpp		longest ideal subsequencq.cpp
majority element two.cpp		majority element two.cpp
max one consecutive.cpp		max one consecutive.cpp
maximal rectangle.cpp		maximal rectangle.cpp
maximise happiness of selected children.cpp		maximise happiness of selected children.cpp
merge k sort list.cpp		merge k sort list.cpp
minimum cost to hire k workers.cpp		minimum cost to hire k workers.cpp
minimum falling path sum 2 .cpp		minimum falling path sum 2 .cpp
minimum height trees.cpp		minimum height trees.cpp
minimum number of operations to make XOR equl to k.cpp		minimum number of operations to make XOR equl to k.cpp
minimum window substrings.cpp		minimum window substrings.cpp
move zeroes.cpp		move zeroes.cpp
next greater element 1.cpp		next greater element 1.cpp
nth tribonacci number.cpp		nth tribonacci number.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Releases

Packages

Contributors 2

Languages

vishalku03/Mix_Dsa

Folders and files

Latest commit

History

Repository files navigation

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Contributors 2

Languages

Packages