Skip to content

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

Notifications You must be signed in to change notification settings

prakharsinghch/dsa-practice

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

dsa-practice

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

LeetCode Topics

Depth-First Search

0094-binary-tree-inorder-traversal
0100-same-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0662-maximum-width-of-binary-tree
0684-redundant-connection
0820-find-eventual-safe-states
0854-making-a-large-island
1029-vertical-order-traversal-of-a-binary-tree
1558-course-schedule-iv
2246-maximum-employees-to-be-invited-to-a-meeting
2764-maximum-number-of-fish-in-a-grid

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0662-maximum-width-of-binary-tree
0684-redundant-connection
0820-find-eventual-safe-states
0854-making-a-large-island
1029-vertical-order-traversal-of-a-binary-tree
1036-rotting-oranges
1558-course-schedule-iv
2583-divide-nodes-into-the-maximum-number-of-groups
2764-maximum-number-of-fish-in-a-grid

Graph

0684-redundant-connection
0820-find-eventual-safe-states
1558-course-schedule-iv
2246-maximum-employees-to-be-invited-to-a-meeting
2583-divide-nodes-into-the-maximum-number-of-groups

Topological Sort

0820-find-eventual-safe-states
1558-course-schedule-iv
2246-maximum-employees-to-be-invited-to-a-meeting

Array

0033-search-in-rotated-sorted-array
0037-sudoku-solver
0051-n-queens
0084-largest-rectangle-in-histogram
0347-top-k-frequent-elements
0496-next-greater-element-i
0540-single-element-in-a-sorted-array
0854-making-a-large-island
1036-rotting-oranges
1364-tuple-with-same-product
1878-check-if-array-is-sorted-and-rotated
1927-maximum-ascending-subarray-sum
2764-maximum-number-of-fish-in-a-grid
3219-make-lexicographically-smallest-array-by-swapping-elements
3372-longest-strictly-increasing-or-strictly-decreasing-subarray
3429-special-array-i
3704-count-partitions-with-even-sum-difference
3721-count-mentions-per-user

Backtracking

0037-sudoku-solver
0051-n-queens

Hash Table

0013-roman-to-integer
0037-sudoku-solver
0146-lru-cache
0347-top-k-frequent-elements
0496-next-greater-element-i
1029-vertical-order-traversal-of-a-binary-tree
1364-tuple-with-same-product
1915-check-if-one-string-swap-can-make-strings-equal

Matrix

0037-sudoku-solver
0854-making-a-large-island
1036-rotting-oranges
2764-maximum-number-of-fish-in-a-grid

Union Find

0684-redundant-connection
0854-making-a-large-island
2583-divide-nodes-into-the-maximum-number-of-groups
2764-maximum-number-of-fish-in-a-grid
3219-make-lexicographically-smallest-array-by-swapping-elements

Sorting

0295-find-median-from-data-stream
0347-top-k-frequent-elements
1029-vertical-order-traversal-of-a-binary-tree
3219-make-lexicographically-smallest-array-by-swapping-elements
3721-count-mentions-per-user

Binary Search

0033-search-in-rotated-sorted-array
0540-single-element-in-a-sorted-array

Two Pointers

0005-longest-palindromic-substring
0151-reverse-words-in-a-string
0295-find-median-from-data-stream

Design

0146-lru-cache
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0295-find-median-from-data-stream

Heap (Priority Queue)

0295-find-median-from-data-stream
0347-top-k-frequent-elements

Data Stream

0295-find-median-from-data-stream

Divide and Conquer

0347-top-k-frequent-elements

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements
1364-tuple-with-same-product
1915-check-if-one-string-swap-can-make-strings-equal

Quickselect

0347-top-k-frequent-elements

Stack

0020-valid-parentheses
0084-largest-rectangle-in-histogram
0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0496-next-greater-element-i

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks

Monotonic Stack

0084-largest-rectangle-in-histogram
0496-next-greater-element-i

String

0005-longest-palindromic-substring
0008-string-to-integer-atoi
0013-roman-to-integer
0014-longest-common-prefix
0020-valid-parentheses
0151-reverse-words-in-a-string
0686-repeated-string-match
1915-check-if-one-string-swap-can-make-strings-equal

Linked List

0146-lru-cache

Doubly-Linked List

0146-lru-cache

Dynamic Programming

0005-longest-palindromic-substring
0124-binary-tree-maximum-path-sum

Math

0013-roman-to-integer
3704-count-partitions-with-even-sum-difference
3721-count-mentions-per-user

Trie

0014-longest-common-prefix

String Matching

0686-repeated-string-match

Prefix Sum

3704-count-partitions-with-even-sum-difference

Simulation

3721-count-mentions-per-user

Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0662-maximum-width-of-binary-tree
1029-vertical-order-traversal-of-a-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0662-maximum-width-of-binary-tree
1029-vertical-order-traversal-of-a-binary-tree

About

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published