Skip to content

AswinBarath/Data-Structures-and-Algorithms

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

320 Commits
.metadata
.metadata
 
 
1047-remove-all-adjacent-duplicates-in-string
1047-remove-all-adjacent-duplicates-in-string
 
 
1091-shortest-path-in-binary-matrix
1091-shortest-path-in-binary-matrix
 
 
116-populating-next-right-pointers-in-each-node
116-populating-next-right-pointers-in-each-node
 
 
117-populating-next-right-pointers-in-each-node-ii
117-populating-next-right-pointers-in-each-node-ii
 
 
1192-critical-connections-in-a-network
1192-critical-connections-in-a-network
 
 
1209-remove-all-adjacent-duplicates-in-string-ii
1209-remove-all-adjacent-duplicates-in-string-ii
 
 
1302-deepest-leaves-sum
1302-deepest-leaves-sum
 
 
1337-the-k-weakest-rows-in-a-matrix
1337-the-k-weakest-rows-in-a-matrix
 
 
1342-number-of-steps-to-reduce-a-number-to-zero
1342-number-of-steps-to-reduce-a-number-to-zero
 
 
1346-check-if-n-and-its-double-exist
1346-check-if-n-and-its-double-exist
 
 
1351-count-negative-numbers-in-a-sorted-matrix
1351-count-negative-numbers-in-a-sorted-matrix
 
 
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
 
 
1385-find-the-distance-value-between-two-arrays
1385-find-the-distance-value-between-two-arrays
 
 
14-longest-common-prefix
14-longest-common-prefix
 
 
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1461-check-if-a-string-contains-all-binary-codes-of-size-k
 
 
1480-running-sum-of-1d-array
1480-running-sum-of-1d-array
 
 
153-find-minimum-in-rotated-sorted-array
153-find-minimum-in-rotated-sorted-array
 
 
1539-kth-missing-positive-number
1539-kth-missing-positive-number
 
 
1608-special-array-with-x-elements-greater-than-or-equal-x
1608-special-array-with-x-elements-greater-than-or-equal-x
 
 
1641-count-sorted-vowel-strings
1641-count-sorted-vowel-strings
 
 
167-two-sum-ii-input-array-is-sorted
167-two-sum-ii-input-array-is-sorted
 
 
1679-max-number-of-k-sum-pairs
1679-max-number-of-k-sum-pairs
 
 
17-letter-combinations-of-a-phone-number
17-letter-combinations-of-a-phone-number
 
 
1855-maximum-distance-between-a-pair-of-values
1855-maximum-distance-between-a-pair-of-values
 
 
190-reverse-bits
190-reverse-bits
 
 
191-number-of-1-bits
191-number-of-1-bits
 
 
20-valid-parentheses
20-valid-parentheses
 
 
2040-kth-smallest-product-of-two-sorted-arrays
2040-kth-smallest-product-of-two-sorted-arrays
 
 
216-combination-sum-iii
216-combination-sum-iii
 
 
222-count-complete-tree-nodes
222-count-complete-tree-nodes
 
 
225-implement-stack-using-queues
225-implement-stack-using-queues
 
 
2264-largest-3-same-digit-number-in-string
2264-largest-3-same-digit-number-in-string
 
 
2265-count-nodes-equal-to-average-of-subtree
2265-count-nodes-equal-to-average-of-subtree
 
 
2269-find-the-k-beauty-of-a-number
2269-find-the-k-beauty-of-a-number
 
 
2295-replace-elements-in-an-array
2295-replace-elements-in-an-array
 
 
2302-count-subarrays-with-score-less-than-k
2302-count-subarrays-with-score-less-than-k
 
 
268-missing-number
268-missing-number
 
 
278-first-bad-version
278-first-bad-version
 
 
29-divide-two-integers
29-divide-two-integers
 
 
304-range-sum-query-2d-immutable
304-range-sum-query-2d-immutable
 
 
318-maximum-product-of-word-lengths
318-maximum-product-of-word-lengths
 
 
32-longest-valid-parentheses
32-longest-valid-parentheses
 
 
322-coin-change
322-coin-change
 
 
329-longest-increasing-path-in-a-matrix
329-longest-increasing-path-in-a-matrix
 
 
33-search-in-rotated-sorted-array
33-search-in-rotated-sorted-array
 
 
330-patching-array
330-patching-array
 
 
34-find-first-and-last-position-of-element-in-sorted-array
34-find-first-and-last-position-of-element-in-sorted-array
 
 
341-flatten-nested-list-iterator
341-flatten-nested-list-iterator
 
 
35-search-insert-position
35-search-insert-position
 
 
350-intersection-of-two-arrays-ii
350-intersection-of-two-arrays-ii
 
 
354-russian-doll-envelopes
354-russian-doll-envelopes
 
 
367-valid-perfect-square
367-valid-perfect-square
 
 
374-guess-number-higher-or-lower
374-guess-number-higher-or-lower
 
 
4-median-of-two-sorted-arrays
4-median-of-two-sorted-arrays
 
 
441-arranging-coins
441-arranging-coins
 
 
456-132-pattern
456-132-pattern
 
 
46-permutations
46-permutations
 
 
47-permutations-ii
47-permutations-ii
 
 
474-ones-and-zeroes
474-ones-and-zeroes
 
 
51-n-queens
51-n-queens
 
 
518-coin-change-2
518-coin-change-2
 
 
52-n-queens-ii
52-n-queens-ii
 
 
581-shortest-unsorted-continuous-subarray
581-shortest-unsorted-continuous-subarray
 
 
62-unique-paths
62-unique-paths
 
 
63-unique-paths-ii
63-unique-paths-ii
 
 
633-sum-of-square-numbers
633-sum-of-square-numbers
 
 
647-palindromic-substrings
647-palindromic-substrings
 
 
69-sqrtx
69-sqrtx
 
 
704-binary-search
704-binary-search
 
 
74-search-a-2d-matrix
74-search-a-2d-matrix
 
 
743-network-delay-time
743-network-delay-time
 
 
744-find-smallest-letter-greater-than-target
744-find-smallest-letter-greater-than-target
 
 
844-backspace-string-compare
844-backspace-string-compare
 
 
852-peak-index-in-a-mountain-array
852-peak-index-in-a-mountain-array
 
 
867-transpose-matrix
867-transpose-matrix
 
 
905-sort-array-by-parity
905-sort-array-by-parity
 
 
Arrays and Strings
Arrays and Strings
 
 
Bitmasking
Bitmasking
 
 
Dynamic Programming
Dynamic Programming
 
 
Hash Tables
Hash Tables
 
 
.project
.project
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 

Repository files navigation

Data Structures and Algorithms

Plan to learn Data Structures and Algorithms

Techniques for efficient learning

➡ Take notes on each and every single concept you learn

➡ Active Recall is the best technique to learn

Framework

  • ➡ Theory of basics from each Data Structure and Algorithm
  • ➡ Code Implementation of each Data Structure and Algorithm
  • ➡ Curate Leetcode Interview Problems and sort them by:
    • Data Structure/Algorithm used
    • Techniques used
    • Optimization used

Advice based on experience

➡ Start solving problems on your own with regular breaks

➡ Use online resources only when necessary and save them in the respective GitHub Repositories

➡ Use Git and GitHub with Habit Tracker for Dopamine Hits & Progress Visibility

👨‍💻 Data Structures Repositories 👨‍💻

👨‍💻 Algorithms Repositories 👨‍💻

👨‍💻 Curated Repositories 👨‍💻

👨‍💻 SDE Sheet Repositories Order-wise Curated 👨‍💻

About

Problems on Data Structures and Algorithms

Topics

java algorithms leetcode data-structures problem-solving

Resources

Readme

License

MIT license
Activity

Stars

5 stars

Watchers

2 watching

Forks

3 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages