LeetCode-problem

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

LeetCode Topics

Dynamic Programming

0064-minimum-path-sum
0085-maximal-rectangle
0095-unique-binary-search-trees-ii
0120-triangle
0474-ones-and-zeroes
0960-delete-columns-to-make-sorted-iii
1458-max-dot-product-of-two-subsequences
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
2435-paths-in-matrix-whose-sum-is-divisible-by-k
3562-maximum-profit-from-trading-stocks-with-discounts
3578-count-partitions-with-max-min-difference-at-most-k

Backtracking

0079-word-search
0095-unique-binary-search-trees-ii

Tree

0095-unique-binary-search-trees-ii
0104-maximum-depth-of-binary-tree
2872-maximum-number-of-k-divisible-components
3562-maximum-profit-from-trading-stocks-with-discounts

Binary Search Tree

0095-unique-binary-search-trees-ii
0167-two-sum-ii-input-array-is-sorted
2141-maximum-running-time-of-n-computers
2618-maximize-the-minimum-powered-city
3454-separate-squares-ii
3619-adjacent-increasing-subarrays-detection-ii

Binary Tree

0095-unique-binary-search-trees-ii
0104-maximum-depth-of-binary-tree

Database

0177-nth-highest-salary
0178-rank-scores
0183-customers-who-never-order

Array

0064-minimum-path-sum
0066-plus-one
0079-word-search
0085-maximal-rectangle
0120-triangle
0167-two-sum-ii-input-array-is-sorted
0238-product-of-array-except-self
0303-range-sum-query-immutable
0407-trapping-rain-water-ii
0417-pacific-atlantic-water-flow
0474-ones-and-zeroes
0759-set-intersection-size-at-least-two
0830-largest-triangle-area
0840-magic-squares-in-grid
0960-delete-columns-to-make-sorted-iii
1018-binary-prefix-divisible-by-5
1458-max-dot-product-of-two-subsequences
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1975-maximum-matrix-sum
2141-maximum-running-time-of-n-computers
2274-keep-multiplying-found-values-by-two
2402-meeting-rooms-iii
2435-paths-in-matrix-whose-sum-is-divisible-by-k
2618-maximize-the-minimum-powered-city
3075-maximize-happiness-of-selected-children
3381-maximum-subarray-sum-with-length-divisible-by-k
3383-taking-maximum-energy-from-the-mystic-dungeon
3454-separate-squares-ii
3501-delete-nodes-from-linked-list-present-in-array
3512-minimum-operations-to-make-array-sum-divisible-by-k
3531-count-covered-buildings
3562-maximum-profit-from-trading-stocks-with-discounts
3578-count-partitions-with-max-min-difference-at-most-k
3592-find-x-sum-of-all-k-long-subarrays-ii
3606-coupon-code-validator
3610-find-x-sum-of-all-k-long-subarrays-i
3616-make-array-elements-equal-to-zero
3619-adjacent-increasing-subarrays-detection-ii
3623-count-number-of-trapezoids-i
3625-count-number-of-trapezoids-ii
3834-minimum-operations-to-convert-all-elements-to-zero

String

0079-word-search
0474-ones-and-zeroes
0960-delete-columns-to-make-sorted-iii
1873-longest-nice-substring
2211-count-collisions-on-a-road
2483-minimum-penalty-for-a-shop
3479-count-the-number-of-substrings-with-dominant-ones
3606-coupon-code-validator

Depth-First Search

0079-word-search
0104-maximum-depth-of-binary-tree
0417-pacific-atlantic-water-flow
2121-find-if-path-exists-in-graph
2872-maximum-number-of-k-divisible-components
3562-maximum-profit-from-trading-stocks-with-discounts

Matrix

0064-minimum-path-sum
0079-word-search
0085-maximal-rectangle
0407-trapping-rain-water-ii
0417-pacific-atlantic-water-flow
0840-magic-squares-in-grid
1975-maximum-matrix-sum
2435-paths-in-matrix-whose-sum-is-divisible-by-k

Two Pointers

0167-two-sum-ii-input-array-is-sorted

Linked List

0147-insertion-sort-list
3501-delete-nodes-from-linked-list-present-in-array

Sorting

0147-insertion-sort-list
0759-set-intersection-size-at-least-two
2141-maximum-running-time-of-n-computers
2274-keep-multiplying-found-values-by-two
2402-meeting-rooms-iii
3075-maximize-happiness-of-selected-children
3531-count-covered-buildings
3606-coupon-code-validator

Math

0060-permutation-sequence
0066-plus-one
0830-largest-triangle-area
0840-magic-squares-in-grid
1925-count-square-sum-triples
3512-minimum-operations-to-make-array-sum-divisible-by-k
3623-count-number-of-trapezoids-i
3625-count-number-of-trapezoids-ii
3676-smallest-number-with-all-set-bits

Geometry

0830-largest-triangle-area
3623-count-number-of-trapezoids-i
3625-count-number-of-trapezoids-ii

Hash Table

0840-magic-squares-in-grid
1873-longest-nice-substring
2274-keep-multiplying-found-values-by-two
2402-meeting-rooms-iii
3381-maximum-subarray-sum-with-length-divisible-by-k
3501-delete-nodes-from-linked-list-present-in-array
3531-count-covered-buildings
3592-find-x-sum-of-all-k-long-subarrays-ii
3606-coupon-code-validator
3610-find-x-sum-of-all-k-long-subarrays-i
3623-count-number-of-trapezoids-i
3625-count-number-of-trapezoids-ii
3834-minimum-operations-to-convert-all-elements-to-zero

Divide and Conquer

1873-longest-nice-substring

Bit Manipulation

1018-binary-prefix-divisible-by-5
1873-longest-nice-substring
3676-smallest-number-with-all-set-bits

Sliding Window

1873-longest-nice-substring
2618-maximize-the-minimum-powered-city
3479-count-the-number-of-substrings-with-dominant-ones
3578-count-partitions-with-max-min-difference-at-most-k
3592-find-x-sum-of-all-k-long-subarrays-ii
3610-find-x-sum-of-all-k-long-subarrays-i

Prefix Sum

0238-product-of-array-except-self
0303-range-sum-query-immutable
2483-minimum-penalty-for-a-shop
2618-maximize-the-minimum-powered-city
3381-maximum-subarray-sum-with-length-divisible-by-k
3383-taking-maximum-energy-from-the-mystic-dungeon
3578-count-partitions-with-max-min-difference-at-most-k
3616-make-array-elements-equal-to-zero

Breadth-First Search

0104-maximum-depth-of-binary-tree
0407-trapping-rain-water-ii
0417-pacific-atlantic-water-flow
2121-find-if-path-exists-in-graph

Heap (Priority Queue)

0407-trapping-rain-water-ii
2402-meeting-rooms-iii
3592-find-x-sum-of-all-k-long-subarrays-ii
3610-find-x-sum-of-all-k-long-subarrays-i

Design

0303-range-sum-query-immutable

Recursion

0060-permutation-sequence

Simulation

2211-count-collisions-on-a-road
2274-keep-multiplying-found-values-by-two
2402-meeting-rooms-iii
3616-make-array-elements-equal-to-zero

Stack

0085-maximal-rectangle
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
2211-count-collisions-on-a-road
3834-minimum-operations-to-convert-all-elements-to-zero

Greedy

0759-set-intersection-size-at-least-two
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1975-maximum-matrix-sum
2141-maximum-running-time-of-n-computers
2618-maximize-the-minimum-powered-city
3075-maximize-happiness-of-selected-children
3834-minimum-operations-to-convert-all-elements-to-zero

Monotonic Stack

0085-maximal-rectangle
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
3834-minimum-operations-to-convert-all-elements-to-zero

Union Find

2121-find-if-path-exists-in-graph

Graph

2121-find-if-path-exists-in-graph

Queue

2618-maximize-the-minimum-powered-city
3578-count-partitions-with-max-min-difference-at-most-k

Enumeration

1925-count-square-sum-triples
3479-count-the-number-of-substrings-with-dominant-ones

Monotonic Queue

3578-count-partitions-with-max-min-difference-at-most-k

Segment Tree

3454-separate-squares-ii

Line Sweep

3454-separate-squares-ii