A collection of LeetCode questions to ace the coding interviews! - Created using LeetHub 2.0 for Firefox

LeetCode Topics

Math

0070-climbing-stairs
3635-smallest-divisible-digit-product-ii

Dynamic Programming

0070-climbing-stairs

Memoization

0070-climbing-stairs

Array

0407-trapping-rain-water-ii
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
2533-bitwise-xor-of-all-pairings
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor

Hash Table

2766-find-the-prefix-common-array-of-two-arrays

Bit Manipulation

2509-minimize-xor
2533-bitwise-xor-of-all-pairings
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor

Greedy

2509-minimize-xor
3635-smallest-divisible-digit-product-ii

Brainteaser

2533-bitwise-xor-of-all-pairings

Breadth-First Search

0407-trapping-rain-water-ii
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

Graph

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

Heap (Priority Queue)

0407-trapping-rain-water-ii
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

Matrix

0407-trapping-rain-water-ii
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

Shortest Path

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

String

3635-smallest-divisible-digit-product-ii

Backtracking

3635-smallest-divisible-digit-product-ii

Number Theory

3635-smallest-divisible-digit-product-ii