Skip to content

pragyan-tech/DSA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

460 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

DSA-practice

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Array

0031-next-permutation
0033-search-in-rotated-sorted-array
0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0042-trapping-rain-water
0045-jump-game-ii
0051-n-queens
0053-maximum-subarray
0056-merge-intervals
0057-insert-interval
0078-subsets
0079-word-search
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0121-best-time-to-buy-and-sell-stock
0130-surrounded-regions
0135-candy
0136-single-number
0200-number-of-islands
0204-count-primes
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0238-product-of-array-except-self
0239-sliding-window-maximum
0260-single-number-iii
0396-rotate-function
0435-non-overlapping-intervals
0455-assign-cookies
0496-next-greater-element-i
0503-next-greater-element-ii
0542-01-matrix
0704-binary-search
0733-flood-fill
0735-asteroid-collision
0739-daily-temperatures
0860-lemonade-change
0907-sum-of-subarray-minimums
0930-binary-subarrays-with-sum
0992-subarrays-with-k-different-integers
1008-construct-binary-search-tree-from-preorder-traversal
1020-number-of-enclaves
1091-shortest-path-in-binary-matrix
1423-maximum-points-you-can-obtain-from-cards
1631-path-with-minimum-effort
1848-minimum-distance-to-the-target-element
2016-maximum-difference-between-increasing-elements
2078-two-furthest-houses-with-different-colors
2104-sum-of-subarray-ranges
2515-shortest-distance-to-target-string-in-a-circular-array
3354-make-array-elements-equal-to-zero
3379-transformed-array
3546-equal-sum-grid-partition-i
3660-jump-game-ix
3740-minimum-distance-between-three-equal-elements-i

Hash Table

0003-longest-substring-without-repeating-characters
0017-letter-combinations-of-a-phone-number
0037-sudoku-solver
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0146-lru-cache
0217-contains-duplicate
0424-longest-repeating-character-replacement
0496-next-greater-element-i
0653-two-sum-iv-input-is-a-bst
0930-binary-subarrays-with-sum
0987-vertical-order-traversal-of-a-binary-tree
0992-subarrays-with-k-different-integers
3740-minimum-distance-between-three-equal-elements-i

Sorting

0056-merge-intervals
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0435-non-overlapping-intervals
0455-assign-cookies
0987-vertical-order-traversal-of-a-binary-tree

Divide and Conquer

0053-maximum-subarray
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0215-kth-largest-element-in-an-array

Dynamic Programming

0005-longest-palindromic-substring
0022-generate-parentheses
0042-trapping-rain-water
0045-jump-game-ii
0053-maximum-subarray
0085-maximal-rectangle
0121-best-time-to-buy-and-sell-stock
0396-rotate-function
0435-non-overlapping-intervals
0509-fibonacci-number
0542-01-matrix
0678-valid-parenthesis-string
0787-cheapest-flights-within-k-stops
0907-sum-of-subarray-minimums
1373-maximum-sum-bst-in-binary-tree
1976-number-of-ways-to-arrive-at-destination
3660-jump-game-ix

Binary Search

0033-search-in-rotated-sorted-array
0222-count-complete-tree-nodes
0704-binary-search
1631-path-with-minimum-effort

Two Pointers

0005-longest-palindromic-substring
0031-next-permutation
0042-trapping-rain-water
0344-reverse-string
0455-assign-cookies
0653-two-sum-iv-input-is-a-bst

String

0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0038-count-and-say
0076-minimum-window-substring
0079-word-search
0282-expression-add-operators
0344-reverse-string
0402-remove-k-digits
0424-longest-repeating-character-replacement
0678-valid-parenthesis-string
0796-rotate-string
1689-partitioning-into-minimum-number-of-deci-binary-numbers
2515-shortest-distance-to-target-string-in-a-circular-array

Math

0029-divide-two-integers
0050-powx-n
0204-count-primes
0231-power-of-two
0282-expression-add-operators
0342-power-of-four
0396-rotate-function
0509-fibonacci-number
0728-self-dividing-numbers
0762-prime-number-of-set-bits-in-binary-representation
1342-number-of-steps-to-reduce-a-number-to-zero
1680-concatenation-of-consecutive-binary-numbers
1922-count-good-numbers

Recursion

0050-powx-n
0231-power-of-two
0342-power-of-four
0509-fibonacci-number
1922-count-good-numbers

Bit Manipulation

0029-divide-two-integers
0078-subsets
0136-single-number
0222-count-complete-tree-nodes
0231-power-of-two
0260-single-number-iii
0342-power-of-four
0762-prime-number-of-set-bits-in-binary-representation
1342-number-of-steps-to-reduce-a-number-to-zero
1680-concatenation-of-consecutive-binary-numbers
2220-minimum-bit-flips-to-convert-number

Memoization

0509-fibonacci-number

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0051-n-queens
0078-subsets
0079-word-search
0282-expression-add-operators

Matrix

0037-sudoku-solver
0079-word-search
0085-maximal-rectangle
0130-surrounded-regions
0200-number-of-islands
0542-01-matrix
0733-flood-fill
1020-number-of-enclaves
1091-shortest-path-in-binary-matrix
1631-path-with-minimum-effort
3546-equal-sum-grid-partition-i

Stack

0020-valid-parentheses
0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0402-remove-k-digits
0496-next-greater-element-i
0503-next-greater-element-ii
0678-valid-parenthesis-string
0735-asteroid-collision
0739-daily-temperatures
0901-online-stock-span
0907-sum-of-subarray-minimums
1008-construct-binary-search-tree-from-preorder-traversal
2104-sum-of-subarray-ranges

Design

0146-lru-cache
0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0901-online-stock-span
0933-number-of-recent-calls

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0239-sliding-window-maximum
0933-number-of-recent-calls

Data Stream

0901-online-stock-span
0933-number-of-recent-calls

Monotonic Stack

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0402-remove-k-digits
0496-next-greater-element-i
0503-next-greater-element-ii
0739-daily-temperatures
0901-online-stock-span
0907-sum-of-subarray-minimums
1008-construct-binary-search-tree-from-preorder-traversal
2104-sum-of-subarray-ranges

Greedy

0045-jump-game-ii
0135-candy
0402-remove-k-digits
0435-non-overlapping-intervals
0455-assign-cookies
0678-valid-parenthesis-string
0860-lemonade-change
1689-partitioning-into-minimum-number-of-deci-binary-numbers
2078-two-furthest-houses-with-different-colors

Linked List

0146-lru-cache

Doubly-Linked List

0146-lru-cache

Simulation

0735-asteroid-collision
1680-concatenation-of-consecutive-binary-numbers
3354-make-array-elements-equal-to-zero
3379-transformed-array

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0239-sliding-window-maximum
0424-longest-repeating-character-replacement
0930-binary-subarrays-with-sum
0992-subarrays-with-k-different-integers
1423-maximum-points-you-can-obtain-from-cards

Prefix Sum

0238-product-of-array-except-self
0930-binary-subarrays-with-sum
1423-maximum-points-you-can-obtain-from-cards
3354-make-array-elements-equal-to-zero
3546-equal-sum-grid-partition-i

Heap (Priority Queue)

0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0743-network-delay-time
0787-cheapest-flights-within-k-stops
1631-path-with-minimum-effort

Monotonic Queue

0239-sliding-window-maximum

Counting

0992-subarrays-with-k-different-integers

Depth-First Search

0079-word-search
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0130-surrounded-regions
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0733-flood-fill
0743-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0987-vertical-order-traversal-of-a-binary-tree
1020-number-of-enclaves
1373-maximum-sum-bst-in-binary-tree
1631-path-with-minimum-effort

Enumeration

0204-count-primes
3546-equal-sum-grid-partition-i

Number Theory

0204-count-primes

Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0173-binary-search-tree-iterator
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0987-vertical-order-traversal-of-a-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal
1373-maximum-sum-bst-in-binary-tree

Binary Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0173-binary-search-tree-iterator
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0987-vertical-order-traversal-of-a-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal
1373-maximum-sum-bst-in-binary-tree

Breadth-First Search

0130-surrounded-regions
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0542-01-matrix
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0733-flood-fill
0743-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0987-vertical-order-traversal-of-a-binary-tree
1020-number-of-enclaves
1091-shortest-path-in-binary-matrix
1631-path-with-minimum-effort

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
1008-construct-binary-search-tree-from-preorder-traversal
1373-maximum-sum-bst-in-binary-tree

Iterator

0173-binary-search-tree-iterator

Quickselect

0215-kth-largest-element-in-an-array

Union-Find

0130-surrounded-regions
0200-number-of-islands
0547-number-of-provinces
0785-is-graph-bipartite
1020-number-of-enclaves
1631-path-with-minimum-effort

Graph Theory

0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0743-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
1976-number-of-ways-to-arrive-at-destination

String Matching

0796-rotate-string

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0802-find-eventual-safe-states
1976-number-of-ways-to-arrive-at-destination

Shortest Path

0743-network-delay-time
0787-cheapest-flights-within-k-stops
1976-number-of-ways-to-arrive-at-destination

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages