Leetcode

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

LeetCode Topics

Math

1817-calculate-money-in-leetcode-bank
3581-the-two-sneaky-numbers-of-digitville
3676-smallest-number-with-all-set-bits
3768-check-if-digits-are-equal-in-string-after-operations-i

String

0049-group-anagrams
0242-valid-anagram
3768-check-if-digits-are-equal-in-string-after-operations-i

Simulation

3768-check-if-digits-are-equal-in-string-after-operations-i

Combinatorics

3768-check-if-digits-are-equal-in-string-after-operations-i

Number Theory

3768-check-if-digits-are-equal-in-string-after-operations-i

Bit Manipulation

3676-smallest-number-with-all-set-bits

Tree

0112-path-sum
0113-path-sum-ii

Depth-First Search

0112-path-sum
0113-path-sum-ii

Breadth-First Search

0112-path-sum

Binary Tree

0112-path-sum
0113-path-sum-ii

Array

0001-two-sum
0049-group-anagrams
0217-contains-duplicate
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
3581-the-two-sneaky-numbers-of-digitville

Dynamic Programming

1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array

Stack

1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array

Greedy

1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array

Monotonic Stack

1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array

Hash Table

0001-two-sum
0049-group-anagrams
0217-contains-duplicate
0242-valid-anagram
3581-the-two-sneaky-numbers-of-digitville

Backtracking

0113-path-sum-ii

Sorting

0049-group-anagrams
0217-contains-duplicate
0242-valid-anagram