Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

patrickpeng0928/Leetcode

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

84 Commits
84 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

The number of LeetCode questions is increasing every week. I'll keep updating for full summary and better solutions. Stay tuned for updates. (Notes: "📖" means you need to subscribe to LeetCode premium membership for the access to premium questions.)

Algorithms

Database

  • [SQL]

Shell

  • [Shell Script]
# Title Solution Time Space Difficulty Tag Note
136 Single Number Python
Scala
O(n) O(1) Easy
190 Reverse Bits Python O(1) O(1) Easy
191 Number of 1 Bits Python O(1) O(1) Easy
231 Power of Two Python O(1) O(1) Easy
342 Power of Four Python O(1) O(1) Easy
371 Sum of Two Integers Python O(1) O(1) Easy
389 Find the Difference Python O(1) O(1) Easy

| 137 | Single Number II | Python | O(n) | O(1) | Medium | | | | 201 | Bitwise AND of Numbers Range | Python | O(1) | O(1) | Medium | | | | 260 | Single Number III | Python | O(1) | O(1) | Medium | | |

# Title Solution Time Space Difficulty Tag Note
136 Single Number Python O(n^2) O(n) Easy
389 Find the Difference Python O(1) O(1) Easy

String

# Title Solution Time Space Difficulty Tag Note
190 Reverse Bits Python O(1) O(1) Easy
231 Power of Two Python O(1) O(1) Easy
342 Power of Four Python O(1) O(1) Easy
003 Longest Substring Without Repeating Characters Python O(n) O(n) Medium Sliding window
159 Longest Substring with At Most Two Distinct Characters Python O(n) O(n) Hard Sliding window
340 Longest Substring with At Most K Distinct Characters Python O(n) O(1) Hard Sliding window
395 Longest Substring with At Least K Repeating Characters Python O(n) O(1) Hard Divide and Conquer
424 Longest Repeating Character Replacement Python O(n) O(1) Medium

Linked List

# Title Solution Time Space Difficulty Tag Note

Stack

# Title Solution Time Space Difficulty Tag Note

Queue

# Title Solution Time Space Difficulty Tag Note

Heap

# Title Solution Time Space Difficulty Tag Note

Tree

# Title Solution Time Space Difficulty Tag Note

Hash Table

# Title Solution Time Space Difficulty Tag Note
136 Single Number Python O(n) O(n) Easy
159 Longest Substring with At Most Two Distinct Characters Python O(n) O(1) Hard Sliding window
340 Longest Substring with At Most K Distinct Characters Python O(n) O(1) Hard Sliding window

Math

# Title Solution Time Space Difficulty Tag Note
136 Single Number Python O(n) O(n) Easy
137 Single Number II Python O(n) O(n) Easy
231 Power of Two Python O(1) O(1) Easy
342 Power of Four Python O(1) O(1) Easy
389 Find the Difference Python O(1) O(1) Easy

Sort

# Title Solution Time Space Difficulty Tag Note

Two Pointers

# Title Solution Time Space Difficulty Tag Note

Recursion

# Title Solution Time Space Difficulty Tag Note
395 Longest Substring with At Least K Repeating Characters Python O(n) O(1) Medium Divide and Conquer

Binary Search

# Title Solution Time Space Difficulty Tag Note

Binary Search Tree

# Title Solution Time Space Difficulty Tag Note

Breadth-First Search

# Title Solution Time Space Difficulty Tag Note

Depth-First Search

# Title Solution Time Space Difficulty Tag Note

Backtracking

# Title Solution Time Space Difficulty Tag Note

Dynamic Programming

# Title Solution Time Space Difficulty Tag Note

Greedy

# Title Solution Time Space Difficulty Tag Note

Design

# Title Solution Time Space Difficulty Tag Note

SQL

# Title Solution Time Space Difficulty Tag Note

Shell Script

# Title Solution Time Space Difficulty Tag Note

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Morty Proxy This is a proxified and sanitized view of the page, visit original site.