Skip to content

About

Structured LeetCode solutions with problem-wise explanations, optimized approaches, and automatic sync.

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Latest commit

 

History

197 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

leetcode-solutions

My LeetCode solutions with automatic sync

LeetCode Topics

Hash Table

Problem Name Difficulty
0003-longest-substring-without-repeating-characters Medium
0012-integer-to-roman Medium
0013-roman-to-integer Easy
0017-letter-combinations-of-a-phone-number Medium
0030-substring-with-concatenation-of-all-words Hard
0036-valid-sudoku Medium
0037-sudoku-solver Hard
0041-first-missing-positive Hard
0049-group-anagrams Medium

String

Problem Name Difficulty
0003-longest-substring-without-repeating-characters Medium
0005-longest-palindromic-substring Medium
0006-zigzag-conversion Medium
0008-string-to-integer-atoi Medium
0010-regular-expression-matching Hard
0012-integer-to-roman Medium
0013-roman-to-integer Easy
0014-longest-common-prefix Easy
0017-letter-combinations-of-a-phone-number Medium
0020-valid-parentheses Easy
0022-generate-parentheses Medium
0028-find-the-index-of-the-first-occurrence-in-a-string Easy
0030-substring-with-concatenation-of-all-words Hard
0032-longest-valid-parentheses Hard
0038-count-and-say Medium
0043-multiply-strings Medium
0044-wildcard-matching Hard
0049-group-anagrams Medium
0058-length-of-last-word Easy
0065-valid-number Hard

Sliding Window

Problem Name Difficulty
0003-longest-substring-without-repeating-characters Medium
0030-substring-with-concatenation-of-all-words Hard

Dynamic Programming

Problem Name Difficulty
0005-longest-palindromic-substring Medium
0010-regular-expression-matching Hard
0022-generate-parentheses Medium
0032-longest-valid-parentheses Hard
0042-trapping-rain-water Hard
0044-wildcard-matching Hard
0045-jump-game-ii Medium
0053-maximum-subarray Medium
0055-jump-game Medium
0062-unique-paths Medium
0063-unique-paths-ii Medium
0064-minimum-path-sum Medium

Recursion

Problem Name Difficulty
0010-regular-expression-matching Hard
0021-merge-two-sorted-lists Easy
0024-swap-nodes-in-pairs Medium
0025-reverse-nodes-in-k-group Hard
0044-wildcard-matching Hard
0050-powx-n Medium
0060-permutation-sequence Hard

Array

Problem Name Difficulty
0004-median-of-two-sorted-arrays Hard
0011-container-with-most-water Medium
0014-longest-common-prefix Easy
0015-3sum Medium
0016-3sum-closest Medium
0018-4sum Medium
0026-remove-duplicates-from-sorted-array Easy
0027-remove-element Easy
0031-next-permutation Medium
0033-search-in-rotated-sorted-array Medium
0034-find-first-and-last-position-of-element-in-sorted-array Medium
0035-search-insert-position Easy
0036-valid-sudoku Medium
0037-sudoku-solver Hard
0039-combination-sum Medium
0040-combination-sum-ii Medium
0041-first-missing-positive Hard
0042-trapping-rain-water Hard
0045-jump-game-ii Medium
0046-permutations Medium
0047-permutations-ii Medium
0049-group-anagrams Medium
0051-n-queens Hard
0053-maximum-subarray Medium
0054-spiral-matrix Medium
0055-jump-game Medium
0056-merge-intervals Medium
0057-insert-interval Medium
0059-spiral-matrix-ii Medium
0063-unique-paths-ii Medium
0064-minimum-path-sum Medium

Binary Search

Problem Name Difficulty
0004-median-of-two-sorted-arrays Hard
0033-search-in-rotated-sorted-array Medium
0034-find-first-and-last-position-of-element-in-sorted-array Medium
0035-search-insert-position Easy

Divide and Conquer

Problem Name Difficulty
0004-median-of-two-sorted-arrays Hard
0023-merge-k-sorted-lists Hard
0053-maximum-subarray Medium

Two Pointers

Problem Name Difficulty
0005-longest-palindromic-substring Medium
0011-container-with-most-water Medium
0015-3sum Medium
0016-3sum-closest Medium
0018-4sum Medium
0019-remove-nth-node-from-end-of-list Medium
0026-remove-duplicates-from-sorted-array Easy
0027-remove-element Easy
0028-find-the-index-of-the-first-occurrence-in-a-string Easy
0031-next-permutation Medium
0042-trapping-rain-water Hard
0061-rotate-list Medium

Math

Problem Name Difficulty
0007-reverse-integer Medium
0009-palindrome-number Easy
0012-integer-to-roman Medium
0013-roman-to-integer Easy
0029-divide-two-integers Medium
0043-multiply-strings Medium
0050-powx-n Medium
0060-permutation-sequence Hard
0062-unique-paths Medium

Greedy

Problem Name Difficulty
0011-container-with-most-water Medium
0044-wildcard-matching Hard
0045-jump-game-ii Medium
0055-jump-game Medium

Trie

Problem Name Difficulty
0014-longest-common-prefix Easy

Sorting

Problem Name Difficulty
0015-3sum Medium
0016-3sum-closest Medium
0018-4sum Medium
0047-permutations-ii Medium
0049-group-anagrams Medium
0056-merge-intervals Medium

Backtracking

Problem Name Difficulty
0017-letter-combinations-of-a-phone-number Medium
0022-generate-parentheses Medium
0037-sudoku-solver Hard
0039-combination-sum Medium
0040-combination-sum-ii Medium
0046-permutations Medium
0047-permutations-ii Medium
0051-n-queens Hard
0052-n-queens-ii Hard

Linked List

Problem Name Difficulty
0019-remove-nth-node-from-end-of-list Medium
0021-merge-two-sorted-lists Easy
0023-merge-k-sorted-lists Hard
0024-swap-nodes-in-pairs Medium
0025-reverse-nodes-in-k-group Hard
0061-rotate-list Medium

Stack

Problem Name Difficulty
0020-valid-parentheses Easy
0032-longest-valid-parentheses Hard
0042-trapping-rain-water Hard

Heap (Priority Queue)

Problem Name Difficulty
0023-merge-k-sorted-lists Hard

Merge Sort

Problem Name Difficulty
0023-merge-k-sorted-lists Hard

String Matching

Problem Name Difficulty
0028-find-the-index-of-the-first-occurrence-in-a-string Easy

Bit Manipulation

Problem Name Difficulty
0029-divide-two-integers Medium

Matrix

Problem Name Difficulty
0036-valid-sudoku Medium
0037-sudoku-solver Hard
0054-spiral-matrix Medium
0059-spiral-matrix-ii Medium
0063-unique-paths-ii Medium
0064-minimum-path-sum Medium

Monotonic Stack

Problem Name Difficulty
0042-trapping-rain-water Hard

Simulation

Problem Name Difficulty
0043-multiply-strings Medium
0054-spiral-matrix Medium
0059-spiral-matrix-ii Medium

Combinatorics

Problem Name Difficulty
0062-unique-paths Medium

About

Structured LeetCode solutions with problem-wise explanations, optimized approaches, and automatic sync.

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Contributors

Languages