Skip to content
/ abhi-leets Public

Collection of LeetCode questions to ace the coding interview!

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

Abhinav-Reddy-k/abhi-leets

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

520 Commits
0032-longest-valid-parentheses
0032-longest-valid-parentheses
 
 
0057-insert-interval
0057-insert-interval
 
 
0133-clone-graph
0133-clone-graph
 
 
0200-number-of-islands
0200-number-of-islands
 
 
0210-course-schedule-ii
0210-course-schedule-ii
 
 
0230-kth-smallest-element-in-a-bst
0230-kth-smallest-element-in-a-bst
 
 
0231-power-of-two
0231-power-of-two
 
 
0407-trapping-rain-water-ii
0407-trapping-rain-water-ii
 
 
0463-island-perimeter
0463-island-perimeter
 
 
0567-permutation-in-string
0567-permutation-in-string
 
 
0638-shopping-offers
0638-shopping-offers
 
 
0744-network-delay-time
0744-network-delay-time
 
 
0789-kth-largest-element-in-a-stream
0789-kth-largest-element-in-a-stream
 
 
0794-swim-in-rising-water
0794-swim-in-rising-water
 
 
0971-shortest-bridge
0971-shortest-bridge
 
 
1029-two-city-scheduling
1029-two-city-scheduling
 
 
1043-partition-array-for-maximum-sum
1043-partition-array-for-maximum-sum
 
 
108-convert-sorted-array-to-binary-search-tree
108-convert-sorted-array-to-binary-search-tree
 
 
1080-insufficient-nodes-in-root-to-leaf-paths
1080-insufficient-nodes-in-root-to-leaf-paths
 
 
1091-shortest-path-in-binary-matrix
1091-shortest-path-in-binary-matrix
 
 
1096-maximum-sum-of-two-non-overlapping-subarrays
1096-maximum-sum-of-two-non-overlapping-subarrays
 
 
11-container-with-most-water
11-container-with-most-water
 
 
110-balanced-binary-tree
110-balanced-binary-tree
 
 
111-minimum-depth-of-binary-tree
111-minimum-depth-of-binary-tree
 
 
1110-delete-nodes-and-return-forest
1110-delete-nodes-and-return-forest
 
 
1123-lowest-common-ancestor-of-deepest-leaves
1123-lowest-common-ancestor-of-deepest-leaves
 
 
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
 
 
124-binary-tree-maximum-path-sum
124-binary-tree-maximum-path-sum
 
 
1302-deepest-leaves-sum
1302-deepest-leaves-sum
 
 
131-palindrome-partitioning
131-palindrome-partitioning
 
 
1315-sum-of-nodes-with-even-valued-grandparent
1315-sum-of-nodes-with-even-valued-grandparent
 
 
1329-sort-the-matrix-diagonally
1329-sort-the-matrix-diagonally
 
 
136-single-number
136-single-number
 
 
1367-linked-list-in-binary-tree
1367-linked-list-in-binary-tree
 
 
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
 
 
140-word-break-ii
140-word-break-ii
 
 
1421-find-numbers-with-even-number-of-digits
1421-find-numbers-with-even-number-of-digits
 
 
1424-maximum-candies-you-can-get-from-boxes
1424-maximum-candies-you-can-get-from-boxes
 
 
144-binary-tree-preorder-traversal
144-binary-tree-preorder-traversal
 
 
1448-count-good-nodes-in-binary-tree
1448-count-good-nodes-in-binary-tree
 
 
145-binary-tree-postorder-traversal
145-binary-tree-postorder-traversal
 
 
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1461-check-if-a-string-contains-all-binary-codes-of-size-k
 
 
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero
 
 
1480-running-sum-of-1d-array
1480-running-sum-of-1d-array
 
 
1488-sort-integers-by-the-power-value
1488-sort-integers-by-the-power-value
 
 
1514-path-with-maximum-probability
1514-path-with-maximum-probability
 
 
1641-count-sorted-vowel-strings
1641-count-sorted-vowel-strings
 
 
1672-richest-customer-wealth
1672-richest-customer-wealth
 
 
1816-truncate-sentence
1816-truncate-sentence
 
 
1920-build-array-from-permutation
1920-build-array-from-permutation
 
 
1929-concatenation-of-array
1929-concatenation-of-array
 
 
1980-find-unique-binary-string
1980-find-unique-binary-string
 
 
200-number-of-islands
200-number-of-islands
 
 
2012-sum-of-beauty-in-the-array
2012-sum-of-beauty-in-the-array
 
 
2035-count-sub-islands
2035-count-sub-islands
 
 
2053-kth-distinct-string-in-an-array
2053-kth-distinct-string-in-an-array
 
 
21-merge-two-sorted-lists
21-merge-two-sorted-lists
 
 
210-course-schedule-ii
210-course-schedule-ii
 
 
2110-number-of-smooth-descent-periods-of-a-stock
2110-number-of-smooth-descent-periods-of-a-stock
 
 
215-kth-largest-element-in-an-array
215-kth-largest-element-in-an-array
 
 
217-contains-duplicate
217-contains-duplicate
 
 
2180-maximum-number-of-tasks-you-can-assign
2180-maximum-number-of-tasks-you-can-assign
 
 
2196-create-binary-tree-from-descriptions
2196-create-binary-tree-from-descriptions
 
 
2213-find-all-people-with-secret
2213-find-all-people-with-secret
 
 
2236-root-equals-sum-of-children
2236-root-equals-sum-of-children
 
 
226-invert-binary-tree
226-invert-binary-tree
 
 
2261-k-divisible-elements-subarrays
2261-k-divisible-elements-subarrays
 
 
2265-count-nodes-equal-to-average-of-subtree
2265-count-nodes-equal-to-average-of-subtree
 
 
23-merge-k-sorted-lists
23-merge-k-sorted-lists
 
 
230-kth-smallest-element-in-a-bst
230-kth-smallest-element-in-a-bst
 
 
2325-decode-the-message
2325-decode-the-message
 
 
235-lowest-common-ancestor-of-a-binary-search-tree
235-lowest-common-ancestor-of-a-binary-search-tree
 
 
236-lowest-common-ancestor-of-a-binary-tree
236-lowest-common-ancestor-of-a-binary-tree
 
 
2394-count-subarrays-with-score-less-than-k
2394-count-subarrays-with-score-less-than-k
 
 
2438-find-closest-node-to-given-two-nodes
2438-find-closest-node-to-given-two-nodes
 
 
257-binary-tree-paths
257-binary-tree-paths
 
 
279-perfect-squares
279-perfect-squares
 
 
2811-determine-the-minimum-sum-of-a-k-avoiding-array
2811-determine-the-minimum-sum-of-a-k-avoiding-array
 
 
287-find-the-duplicate-number
287-find-the-duplicate-number
 
 
310-minimum-height-trees
310-minimum-height-trees
 
 
3142-longest-unequal-adjacent-groups-subsequence-ii
3142-longest-unequal-adjacent-groups-subsequence-ii
 
 
3213-count-subarrays-where-max-element-appears-at-least-k-times
3213-count-subarrays-where-max-element-appears-at-least-k-times
 
 
329-longest-increasing-path-in-a-matrix
329-longest-increasing-path-in-a-matrix
 
 
337-house-robber-iii
337-house-robber-iii
 
 
3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii
3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii
 
 
3685-count-subarrays-of-length-three-with-a-condition
3685-count-subarrays-of-length-three-with-a-condition
 
 
3761-maximum-difference-between-even-and-odd-frequency-ii
3761-maximum-difference-between-even-and-odd-frequency-ii
 
 
39-combination-sum
39-combination-sum
 
 
416-partition-equal-subset-sum
416-partition-equal-subset-sum
 
 
435-non-overlapping-intervals
435-non-overlapping-intervals
 
 
437-path-sum-iii
437-path-sum-iii
 
 
438-find-all-anagrams-in-a-string
438-find-all-anagrams-in-a-string
 
 
46-permutations
46-permutations
 
 
463-island-perimeter
463-island-perimeter
 
 
47-permutations-ii
47-permutations-ii
 
 
494-target-sum
494-target-sum
 
 
501-find-mode-in-binary-search-tree
501-find-mode-in-binary-search-tree
 
 
508-most-frequent-subtree-sum
508-most-frequent-subtree-sum
 
 
513-find-bottom-left-tree-value
513-find-bottom-left-tree-value
 
 

Repository files navigation

abhi-leets

Collection of LeetCode questions to ace the coding interview!

LeetCode Topics

Hash Table
0133-clone-graph
0567-permutation-in-string

Two Pointers
0567-permutation-in-string

String
0032-longest-valid-parentheses
0567-permutation-in-string
3142-longest-unequal-adjacent-groups-subsequence-ii
3761-maximum-difference-between-even-and-odd-frequency-ii

Sliding Window
0567-permutation-in-string
1096-maximum-sum-of-two-non-overlapping-subarrays
2394-count-subarrays-with-score-less-than-k
3213-count-subarrays-where-max-element-appears-at-least-k-times
3761-maximum-difference-between-even-and-odd-frequency-ii

Tree
0230-kth-smallest-element-in-a-bst
0789-kth-largest-element-in-a-stream
3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii

Design
0789-kth-largest-element-in-a-stream

Binary Search Tree
0230-kth-smallest-element-in-a-bst
0789-kth-largest-element-in-a-stream
0794-swim-in-rising-water
2180-maximum-number-of-tasks-you-can-assign
2394-count-subarrays-with-score-less-than-k

Heap (Priority Queue)
0407-trapping-rain-water-ii
0744-network-delay-time
0789-kth-largest-element-in-a-stream
0794-swim-in-rising-water

Binary Tree
0230-kth-smallest-element-in-a-bst
0789-kth-largest-element-in-a-stream

Data Stream
0789-kth-largest-element-in-a-stream

Array
0057-insert-interval
0200-number-of-islands
0407-trapping-rain-water-ii
0463-island-perimeter
0638-shopping-offers
0794-swim-in-rising-water
0971-shortest-bridge
1096-maximum-sum-of-two-non-overlapping-subarrays
1421-find-numbers-with-even-number-of-digits
1424-maximum-candies-you-can-get-from-boxes
2035-count-sub-islands
2180-maximum-number-of-tasks-you-can-assign
2394-count-subarrays-with-score-less-than-k
3142-longest-unequal-adjacent-groups-subsequence-ii
3213-count-subarrays-where-max-element-appears-at-least-k-times
3685-count-subarrays-of-length-three-with-a-condition

Depth-First Search
0133-clone-graph
0200-number-of-islands
0210-course-schedule-ii
0230-kth-smallest-element-in-a-bst
0463-island-perimeter
0744-network-delay-time
0794-swim-in-rising-water
0971-shortest-bridge
2035-count-sub-islands
2213-find-all-people-with-secret
2438-find-closest-node-to-given-two-nodes
3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii

Dynamic Programming
0032-longest-valid-parentheses
0638-shopping-offers
1096-maximum-sum-of-two-non-overlapping-subarrays
1488-sort-integers-by-the-power-value
3142-longest-unequal-adjacent-groups-subsequence-ii

Stack
0032-longest-valid-parentheses

Memoization
0638-shopping-offers
1488-sort-integers-by-the-power-value

Sorting
1488-sort-integers-by-the-power-value
2180-maximum-number-of-tasks-you-can-assign
2213-find-all-people-with-secret

Backtracking
0638-shopping-offers

Bit Manipulation
0231-power-of-two
0638-shopping-offers

Bitmask
0638-shopping-offers

Breadth-First Search
0133-clone-graph
0200-number-of-islands
0210-course-schedule-ii
0407-trapping-rain-water-ii
0463-island-perimeter
0744-network-delay-time
0794-swim-in-rising-water
0971-shortest-bridge
1424-maximum-candies-you-can-get-from-boxes
2035-count-sub-islands
2213-find-all-people-with-secret
3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii

Matrix
0200-number-of-islands
0407-trapping-rain-water-ii
0463-island-perimeter
0794-swim-in-rising-water
0971-shortest-bridge
2035-count-sub-islands

Graph
0133-clone-graph
0210-course-schedule-ii
0744-network-delay-time
1424-maximum-candies-you-can-get-from-boxes
2213-find-all-people-with-secret
2438-find-closest-node-to-given-two-nodes

Topological Sort
0210-course-schedule-ii

Union Find
0200-number-of-islands
0794-swim-in-rising-water
2035-count-sub-islands
2213-find-all-people-with-secret

Shortest Path
0744-network-delay-time

Math
0231-power-of-two
1421-find-numbers-with-even-number-of-digits
2811-determine-the-minimum-sum-of-a-k-avoiding-array

Recursion
0231-power-of-two

Greedy
2180-maximum-number-of-tasks-you-can-assign
2811-determine-the-minimum-sum-of-a-k-avoiding-array

Prefix Sum
2394-count-subarrays-with-score-less-than-k
3761-maximum-difference-between-even-and-odd-frequency-ii

Queue
2180-maximum-number-of-tasks-you-can-assign

Monotonic Queue
2180-maximum-number-of-tasks-you-can-assign

Enumeration
3761-maximum-difference-between-even-and-odd-frequency-ii

About

Collection of LeetCode questions to ace the coding interview!

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages