LeetCodeSolutions

Name		Name	Last commit message	Last commit date
Latest commit History 2,341 Commits
.gitignore		.gitignore
0001 Two Sum.py		0001 Two Sum.py
0002 Add Two Numbers.java		0002 Add Two Numbers.java
0003 Longest Substring Without Repeating Characters.py		0003 Longest Substring Without Repeating Characters.py
0004 Median of Two Sorted Arrays.py		0004 Median of Two Sorted Arrays.py
005 Longest Palindromic Substring.js		005 Longest Palindromic Substring.js
005 Longest Palindromic Substring.py		005 Longest Palindromic Substring.py
006 ZigZag Conversion.ts		006 ZigZag Conversion.ts
007 Reverse Integer.java		007 Reverse Integer.java
008 String to Integer (atoi).py		008 String to Integer (atoi).py
009 Palindrome Number.java		009 Palindrome Number.java
010 Regular Expression Matching.c		010 Regular Expression Matching.c
010 Regular Expression Matching.js		010 Regular Expression Matching.js
010 Regular Expression Matching.py		010 Regular Expression Matching.py
011 Container With Most Water.py		011 Container With Most Water.py
012 Integer to Roman.py		012 Integer to Roman.py
013 Roman To Integer.py		013 Roman To Integer.py
014 Longest Common Prefix.py		014 Longest Common Prefix.py
015 3Sum.py		015 3Sum.py
015 3Sum.ts		015 3Sum.ts
016 3Sum Closest.py		016 3Sum Closest.py
017 Letter Combinations of a Phone Number.py		017 Letter Combinations of a Phone Number.py
018 4Sum.py		018 4Sum.py
019 Remove Nth Node From End of List.py		019 Remove Nth Node From End of List.py
020 Valid Parentheses.py		020 Valid Parentheses.py
021 Merge Two Sorted Lists.java		021 Merge Two Sorted Lists.java
022 Generate Parentheses.py		022 Generate Parentheses.py
023 Merge k Sorted Lists.cpp		023 Merge k Sorted Lists.cpp
023 Merge k Sorted Lists.py		023 Merge k Sorted Lists.py
024 Swap Nodes in Pairs.java		024 Swap Nodes in Pairs.java
025 Reverse Nodes in k-Group.java		025 Reverse Nodes in k-Group.java
025 Reverse Nodes in k-Group.py		025 Reverse Nodes in k-Group.py
026 Remove Duplicated from Sorted Array.py		026 Remove Duplicated from Sorted Array.py
027 Remove Elements.py		027 Remove Elements.py
028 Implement strStr().py		028 Implement strStr().py
029 Divide Two Integers.py		029 Divide Two Integers.py
030 Substring with Concatenation of All Words.py		030 Substring with Concatenation of All Words.py
031 Next Permutation.py		031 Next Permutation.py
032 Longest Valid Parentheses.py		032 Longest Valid Parentheses.py
033 Search in Rotated Sorted Array.py		033 Search in Rotated Sorted Array.py
034 Find First and Last Position of Element in Sorted Array.py		034 Find First and Last Position of Element in Sorted Array.py
035 Search Insert Position.py		035 Search Insert Position.py
035 Search Insert Position.ts		035 Search Insert Position.ts
036 Valid Sudoku.py		036 Valid Sudoku.py
037 Sudoku Solver.py		037 Sudoku Solver.py
038 Count and Say.py		038 Count and Say.py
039 Combination Sum.cpp		039 Combination Sum.cpp
039 Combination Sum.py		039 Combination Sum.py
040 Combination Sum II.py		040 Combination Sum II.py
041 First Missing Positive.py		041 First Missing Positive.py
042 Trapping Rain Water.py		042 Trapping Rain Water.py
043 Multiply Strings.py		043 Multiply Strings.py
044 Wildcard Matching.py		044 Wildcard Matching.py
045 Jump Game II.py		045 Jump Game II.py
046 Permutations.py		046 Permutations.py
047 Permutations II.py		047 Permutations II.py
048 Rotate Image.cs		048 Rotate Image.cs
049 Group Anagrams.py		049 Group Anagrams.py
050 Pow(x, n).c		050 Pow(x, n).c
050 Pow(x, n).py		050 Pow(x, n).py
051 N-Queens.py		051 N-Queens.py
053 Maximum Subarray.py		053 Maximum Subarray.py
054 Spiral Matrix.py		054 Spiral Matrix.py
055 Jump Game.py		055 Jump Game.py
056 Merge Intervals.py		056 Merge Intervals.py
056 Merge Intervals.ts		056 Merge Intervals.ts
057 Insert Intervals.py		057 Insert Intervals.py
058 Length of Last Word.c		058 Length of Last Word.c
059 Spiral Matrix II.py		059 Spiral Matrix II.py
060 Permutation Sequence.ts		060 Permutation Sequence.ts
061 Rotate List.c		061 Rotate List.c
062 Unique Paths.py		062 Unique Paths.py
063 Unique Path II.py		063 Unique Path II.py
064 Minimum Path Sum.py		064 Minimum Path Sum.py
065 Valid Number.py		065 Valid Number.py
066 Plus One.ts		066 Plus One.ts
067 Add Binary.py		067 Add Binary.py
068 Text Justification.py		068 Text Justification.py
069 Sqrt(x).c		069 Sqrt(x).c
069 Sqrt(x).java		069 Sqrt(x).java
070 Climbing Stairs.py		070 Climbing Stairs.py
071 Simplify Path.py		071 Simplify Path.py
072 Edit Distance.py		072 Edit Distance.py
073 Set Matrix Zeroes.py		073 Set Matrix Zeroes.py
074 Search a 2D Matrix.py		074 Search a 2D Matrix.py
075 Sort Colors.py		075 Sort Colors.py
076 Minimum Window Substring.py		076 Minimum Window Substring.py
077 Combinations.py		077 Combinations.py
078 Subsets.py		078 Subsets.py
079 Word Search.py		079 Word Search.py
080 Remove Duplicates from Sorted Array II.py		080 Remove Duplicates from Sorted Array II.py
081 Search in Rotated Sorted Array II.py		081 Search in Rotated Sorted Array II.py
082 Remove Duplicates from Sorted List II.java		082 Remove Duplicates from Sorted List II.java
083 Remove Duplicates From Sorted List.java		083 Remove Duplicates From Sorted List.java
084 Largest Rectangle in Histogram.py		084 Largest Rectangle in Histogram.py
085 Maximal Rectangle.py		085 Maximal Rectangle.py
086 Partition List.java		086 Partition List.java
087 Scramble String.py		087 Scramble String.py
088 Merge Sorted Array.py		088 Merge Sorted Array.py
089 Gray Codes.c		089 Gray Codes.c

jz33/LeetCodeSolutions

Folders and files

Latest commit

History

Repository files navigation

LeetCodeSolutions

Category of some questions (in work):

O(log(n))

Binary Search

Binary Search on Matrix

Binary Guess

O(n)

Two Pointers Both Sides

Two Pointers One Side

Two Pointers Merge

Hashmap

Prefix Sum or Prefix Max

Sliding Window

Monotonic Stack

Calculator

Stack on Parentheses

Intervals

1-D Iteration or Greedy

Hashing

Bucket Sort

O(nlog(n))

Heap

Sorted Map

Divide and Conquer

Trie

O(n^2)

2-D Matrix Iterations

Dynamic Programming

Constant States Dynamic Programming

1-D Cache Incremental Dynamic Programming

1-D Cache Replacement Dynamic Programming

2-D Cache Dynamic Programming

Top down Dynamic Programming (Recursive + Memorization)

Single Linked List

Double Linked List

Tree

Preorder Traversal

Inorder Traversal, Binary Search Tree

Postorder Traversal

LCA

Level Order Traversal

Tree constructions and serializations

Graph

BFS on Matrix

BFS on Graph

BFS with Dijkstra E * log(V)

DFS or Backtrack on Matrix

DFS or Backtrack on Graph

Union Find

Topological Sort O(E + V)

Special Graph Algorithms

Math, Numbers, Binary or Geometry

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Contributors 3

Languages

Packages