Name		Name	Last commit message	Last commit date
Latest commit History 503 Commits
CSES Problem Set		CSES Problem Set
Striver SDE Sheet		Striver SDE Sheet
01-matrix.cpp		01-matrix.cpp
3sum.cpp		3sum.cpp
AnalyseAttendance.cpp		AnalyseAttendance.cpp
Basketball Exercise.cpp		Basketball Exercise.cpp
BigBossProbelm.cpp		BigBossProbelm.cpp
BinaryTreeTraversal.cpp		BinaryTreeTraversal.cpp
CombinationStringDigits.c		CombinationStringDigits.c
CompareTwoLinkedList.cpp		CompareTwoLinkedList.cpp
Count-Palindromies-inA-Tree.cpp		Count-Palindromies-inA-Tree.cpp
DisjointSet.cpp		DisjointSet.cpp
EQUALSTRING.cpp		EQUALSTRING.cpp
Extended-Master-Theorem.cpp		Extended-Master-Theorem.cpp
FCFS-Scheduling.c		FCFS-Scheduling.c
InserNodeAtSpecificPositionLinkedList.cpp		InserNodeAtSpecificPositionLinkedList.cpp
LowestCommonAncestor.cpp		LowestCommonAncestor.cpp
PascalTriangle.cpp		PascalTriangle.cpp
PythagoreanTriplet.cpp		PythagoreanTriplet.cpp
README.md		README.md
ReverseDoublyLinkedList.cpp		ReverseDoublyLinkedList.cpp
ReverseLinkedList.cpp		ReverseLinkedList.cpp
SARGAMformingCircularLinkedList.cpp		SARGAMformingCircularLinkedList.cpp
Stack and its operations		Stack and its operations
Ticket-Collector.cpp		Ticket-Collector.cpp
TreeHeight.cpp		TreeHeight.cpp
accounts-merge.cpp		accounts-merge.cpp
add-binary.cpp		add-binary.cpp
add-strings.cpp		add-strings.cpp
add-to-array-form-of-integer.cpp		add-to-array-form-of-integer.cpp
add-two-numbers.cpp		add-two-numbers.cpp
all-paths-from-source-to-target.cpp		all-paths-from-source-to-target.cpp
as-far-from-land-as-possible.cpp		as-far-from-land-as-possible.cpp
assign-cookies.cpp		assign-cookies.cpp
average-of-levels-in-binary-tree.cpp		average-of-levels-in-binary-tree.cpp
bag-of-tokens.cpp		bag-of-tokens.cpp
balanced-binary-tree.cpp		balanced-binary-tree.cpp
baseball-game.cpp		baseball-game.cpp
bellmon-ford.cpp		bellmon-ford.cpp
best-sightseeing-pair.cpp		best-sightseeing-pair.cpp
best-team-with-no-conflicts.cpp		best-team-with-no-conflicts.cpp
best-time-to-buy-and-sell-stock.cpp		best-time-to-buy-and-sell-stock.cpp
binary-tree-level-order-traversal.cpp		binary-tree-level-order-traversal.cpp
binary-tree-maximum-path-sum.cpp		binary-tree-maximum-path-sum.cpp
binary-tree-paths.cpp		binary-tree-paths.cpp
binary-tree-pruning.cpp		binary-tree-pruning.cpp
binary-tree-right-side-view.cpp		binary-tree-right-side-view.cpp
binary-tree-zigzag-level-order-traversal.cpp		binary-tree-zigzag-level-order-traversal.cpp
bipartite-graph.cpp		bipartite-graph.cpp
capacity-to-ship-packages-within-d-days.cpp		capacity-to-ship-packages-within-d-days.cpp
cheapest-flights-within-k-stops.cpp		cheapest-flights-within-k-stops.cpp
check-if-n-and-its-double-exist.cpp		check-if-n-and-its-double-exist.cpp
check-if-two-arrays-are-equal-or-not.cpp		check-if-two-arrays-are-equal-or-not.cpp
climbing-stairs.cpp		climbing-stairs.cpp
combination-sum.cpp		combination-sum.cpp
construct-binary-search-tree-from-preorder-traversal.cpp		construct-binary-search-tree-from-preorder-traversal.cpp
construct-binary-tree-from-preorder-and-inorder-traversal.cpp		construct-binary-tree-from-preorder-and-inorder-traversal.cpp
construct-quad-tree.cpp		construct-quad-tree.cpp
construct-string-from-binary-tree.cpp		construct-string-from-binary-tree.cpp
container-with-most-water.cpp		container-with-most-water.cpp
contains-duplicate.cpp		contains-duplicate.cpp
convert-sentence-equivalent-mobile-numeric-keypad-sequence.cpp		convert-sentence-equivalent-mobile-numeric-keypad-sequence.cpp
convert-sorted-array-to-binary-search-tree.cpp		convert-sorted-array-to-binary-search-tree.cpp
count-complete-tree-nodes.cpp		count-complete-tree-nodes.cpp
count-good-nodes-in-binary-tree.cpp		count-good-nodes-in-binary-tree.cpp
count-sub-islands.cpp		count-sub-islands.cpp
counting-bits.cpp		counting-bits.cpp
cycle-detection-in-undirected-graph.cpp		cycle-detection-in-undirected-graph.cpp
delete-columns-to-make-sorted.cpp		delete-columns-to-make-sorted.cpp
delete-operation-for-two-strings.cpp		delete-operation-for-two-strings.cpp
detect-capital.cpp		detect-capital.cpp
determine-if-string-halves-are-alike.cpp		determine-if-string-halves-are-alike.cpp
determine-if-two-strings-are-close.cpp		determine-if-two-strings-are-close.cpp
earliest-possible-day-of-full-bloom.cpp		earliest-possible-day-of-full-bloom.cpp
edit-distance.cpp		edit-distance.cpp
excel-sheet-column-number.cpp		excel-sheet-column-number.cpp
fibonacci-number.cpp		fibonacci-number.cpp
find-all-numbers-disappeared-in-an-array.cpp		find-all-numbers-disappeared-in-an-array.cpp
find-closest-node-to-given-two-nodes.cpp		find-closest-node-to-given-two-nodes.cpp
find-eventual-safe-states.cpp		find-eventual-safe-states.cpp
find-expression-duplicate-parenthesis-not.cpp		find-expression-duplicate-parenthesis-not.cpp
find-first-and-last-position-of-element-in-sorted-array.cpp		find-first-and-last-position-of-element-in-sorted-array.cpp
find-minimum-in-rotated-sorted-array.cpp		find-minimum-in-rotated-sorted-array.cpp
find-original-array-from-doubled-array.cpp		find-original-array-from-doubled-array.cpp
find-the-index-of-the-first-occurrence-in-a-string.cpp		find-the-index-of-the-first-occurrence-in-a-string.cpp
find-the-town-judge.cpp		find-the-town-judge.cpp
first-bad-version.cpp		first-bad-version.cpp
first-missing-positive.cpp		first-missing-positive.cpp
first-unique-character-in-a-string.cpp		first-unique-character-in-a-string.cpp
flood-fill.cpp		flood-fill.cpp
floor-&-ceil-average.cpp		floor-&-ceil-average.cpp
floyd-warshall.cpp		floyd-warshall.cpp
greatest-common-divisor-of-strings.cpp		greatest-common-divisor-of-strings.cpp
group-anagrams.cpp		group-anagrams.cpp
guess-number-higher-or-lower.cpp		guess-number-higher-or-lower.cpp
hamming-distance.cpp		hamming-distance.cpp
happy-number.cpp		happy-number.cpp
height-checker.cpp		height-checker.cpp
hourglassSum.cpp		hourglassSum.cpp
house-robber-ii.cpp		house-robber-ii.cpp

Repository files navigation

Data-Structure-and-Algorithm-with-Aadi

This repository is for Data Structures & Algorithms questions that I'll be facing in acing this journey. I have made this repo to track myself and practice consistently. It may also be helpful to someone who might looking for problems.

Why I made this repo? To track my progress and to maintain streak I have pressure to solve atleast a question daily. DSA is not a one day or one month process, its around a year process if you're doing steadily and consistently.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Data-Structure-and-Algorithm-with-Aadi

About

Releases

Packages

Languages

ab213/Data-Structures-and-Algorithms-with-Aadi

Folders and files

Latest commit

History

Repository files navigation

Data-Structure-and-Algorithm-with-Aadi

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages