LeetCode

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

LeetCode Topics

Math

Problem Name	Difficulty
0007-reverse-integer	Medium
0050-powx-n	Medium
0069-sqrtx	Easy
0258-add-digits	Easy
0326-power-of-three	Easy
0367-valid-perfect-square	Easy
0504-base-7	Easy
0633-sum-of-square-numbers	Medium
1137-n-th-tribonacci-number	Easy
1281-subtract-the-product-and-sum-of-digits-of-an-integer	Easy
2119-a-number-after-a-double-reversal	Easy
3658-gcd-of-odd-and-even-sums	Easy
3867-sum-of-gcd-of-formed-pairs	Medium

Binary Search

Problem Name	Difficulty
0034-find-first-and-last-position-of-element-in-sorted-array	Medium
0035-search-insert-position	Easy
0069-sqrtx	Easy
0367-valid-perfect-square	Easy
0633-sum-of-square-numbers	Medium
0704-binary-search	Easy
0852-peak-index-in-a-mountain-array	Medium
2812-find-the-safest-path-in-a-grid	Medium

Two Pointers

Problem Name	Difficulty
0026-remove-duplicates-from-sorted-array	Easy
0633-sum-of-square-numbers	Medium
3867-sum-of-gcd-of-formed-pairs	Medium

Array

Problem Name	Difficulty
0026-remove-duplicates-from-sorted-array	Easy
0034-find-first-and-last-position-of-element-in-sorted-array	Medium
0035-search-insert-position	Easy
0136-single-number	Easy
0704-binary-search	Easy
0724-find-pivot-index	Easy
0852-peak-index-in-a-mountain-array	Medium
1207-unique-number-of-occurrences	Easy
1991-find-the-middle-index-in-array	Easy
2812-find-the-safest-path-in-a-grid	Medium
3867-sum-of-gcd-of-formed-pairs	Medium

Hash Table

Problem Name	Difficulty
0242-valid-anagram	Easy
1207-unique-number-of-occurrences	Easy

Bit Manipulation

Problem Name	Difficulty
0136-single-number	Easy

Recursion

Problem Name	Difficulty
0050-powx-n	Medium
0326-power-of-three	Easy

Dynamic Programming

Problem Name	Difficulty
1137-n-th-tribonacci-number	Easy

Memoization

Problem Name	Difficulty
1137-n-th-tribonacci-number	Easy

String

Problem Name	Difficulty
0242-valid-anagram	Easy
0504-base-7	Easy

Simulation

Problem Name	Difficulty
0258-add-digits	Easy
3867-sum-of-gcd-of-formed-pairs	Medium

Number Theory

Problem Name	Difficulty
0258-add-digits	Easy
3658-gcd-of-odd-and-even-sums	Easy
3867-sum-of-gcd-of-formed-pairs	Medium

Sorting

Problem Name	Difficulty
0242-valid-anagram	Easy
3867-sum-of-gcd-of-formed-pairs	Medium

Breadth-First Search

Problem Name	Difficulty
2812-find-the-safest-path-in-a-grid	Medium

Union-Find

Problem Name	Difficulty
2812-find-the-safest-path-in-a-grid	Medium

Heap (Priority Queue)

Problem Name	Difficulty
2812-find-the-safest-path-in-a-grid	Medium

Matrix

Problem Name	Difficulty
2812-find-the-safest-path-in-a-grid	Medium

Prefix Sum

Problem Name	Difficulty
0724-find-pivot-index	Easy
1991-find-the-middle-index-in-array	Easy