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

LeetCode Topics

Array

Problem Name	Difficulty
0001-two-sum
0036-valid-sudoku
0047-permutations-ii
0944-delete-columns-to-make-sorted
0955-delete-columns-to-make-sorted-ii
0960-delete-columns-to-make-sorted-iii
1536-minimum-swaps-to-arrange-a-binary-grid	Medium
1582-special-positions-in-a-binary-matrix	Easy
2141-maximum-running-time-of-n-computers
3075-maximize-happiness-of-selected-children
3381-maximum-subarray-sum-with-length-divisible-by-k
3433-count-mentions-per-user
3531-count-covered-buildings
3578-count-partitions-with-max-min-difference-at-most-k
3606-coupon-code-validator

Hash Table

Problem Name	Difficulty
0001-two-sum
0036-valid-sudoku
0299-bulls-and-cows
3381-maximum-subarray-sum-with-length-divisible-by-k
3531-count-covered-buildings
3606-coupon-code-validator

Prefix Sum

Problem Name	Difficulty
3129-find-all-possible-stable-binary-arrays-i	Medium
3130-find-all-possible-stable-binary-arrays-ii	Hard
3381-maximum-subarray-sum-with-length-divisible-by-k
3578-count-partitions-with-max-min-difference-at-most-k

Tree

Problem Name	Difficulty
0110-balanced-binary-tree
1382-balance-a-binary-search-tree
2872-maximum-number-of-k-divisible-components

Depth-First Search

Problem Name	Difficulty
0110-balanced-binary-tree
1382-balance-a-binary-search-tree
2872-maximum-number-of-k-divisible-components

String

Problem Name	Difficulty
0299-bulls-and-cows
0944-delete-columns-to-make-sorted
0955-delete-columns-to-make-sorted-ii
0960-delete-columns-to-make-sorted-iii
1545-find-kth-bit-in-nth-binary-string	Medium
1758-minimum-changes-to-make-alternating-binary-string	Easy
1784-check-if-binary-string-has-at-most-one-segment-of-ones	Easy
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium
3606-coupon-code-validator

Counting

Problem Name	Difficulty
0299-bulls-and-cows

Binary Search

Problem Name	Difficulty
2141-maximum-running-time-of-n-computers

Greedy

Problem Name	Difficulty
0955-delete-columns-to-make-sorted-ii
1382-balance-a-binary-search-tree
1536-minimum-swaps-to-arrange-a-binary-grid	Medium
2141-maximum-running-time-of-n-computers
3075-maximize-happiness-of-selected-children

Sorting

Problem Name	Difficulty
0047-permutations-ii
2141-maximum-running-time-of-n-computers
3075-maximize-happiness-of-selected-children
3433-count-mentions-per-user
3531-count-covered-buildings
3606-coupon-code-validator

Dynamic Programming

Problem Name	Difficulty
0960-delete-columns-to-make-sorted-iii
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium
3129-find-all-possible-stable-binary-arrays-i	Medium
3130-find-all-possible-stable-binary-arrays-ii	Hard
3578-count-partitions-with-max-min-difference-at-most-k

Queue

Problem Name	Difficulty
3578-count-partitions-with-max-min-difference-at-most-k

Sliding Window

Problem Name	Difficulty
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium
3578-count-partitions-with-max-min-difference-at-most-k

Monotonic Queue

Problem Name	Difficulty
3578-count-partitions-with-max-min-difference-at-most-k

Math

Problem Name	Difficulty
1523-count-odd-numbers-in-an-interval-range
1925-count-square-sum-triples
3433-count-mentions-per-user

Enumeration

Problem Name	Difficulty
1925-count-square-sum-triples

Simulation

Problem Name	Difficulty
1545-find-kth-bit-in-nth-binary-string	Medium
3433-count-mentions-per-user

Matrix

Problem Name	Difficulty
0036-valid-sudoku
1536-minimum-swaps-to-arrange-a-binary-grid	Medium
1582-special-positions-in-a-binary-matrix	Easy

Backtracking

Problem Name	Difficulty
0047-permutations-ii

Binary Tree

Problem Name	Difficulty
0110-balanced-binary-tree
1382-balance-a-binary-search-tree

Divide and Conquer

Problem Name	Difficulty
1382-balance-a-binary-search-tree

Binary Search Tree

Problem Name	Difficulty
1382-balance-a-binary-search-tree

Database

Problem Name	Difficulty
0175-combine-two-tables
1141-user-activity-for-the-past-30-days-i	Easy
1148-article-views-i	Easy
1341-movie-rating	Medium
1729-find-followers-count

Recursion

Problem Name	Difficulty
1545-find-kth-bit-in-nth-binary-string	Medium

Bit Manipulation

Problem Name	Difficulty
1009-complement-of-base-10-integer	Easy