Skip to content

obelisk0114/LeetCode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

365 Commits
.settings
.settings
 
 
src
src
 
 
.classpath
.classpath
 
 
.editorconfig
.editorconfig
 
 
.gitignore
.gitignore
 
 
.project
.project
 
 
README.md
README.md
 
 

Repository files navigation

LeetCode

1-10

  1. Two Sum
  2. Add Two Numbers
  3. Longest Substring Without Repeating Characters
  4. Median of Two Sorted Arrays
  5. Longest Palindromic Substring
  6. ZigZag Conversion
  7. Reverse Integer
  8. String to Integer (atoi)
  9. Palindrome Number
  10. Regular Expression Matching

11-20

  1. Container With Most Water
  2. Integer to Roman
  3. Roman to Integer
  4. Longest Common Prefix
  5. 3Sum
  6. 3Sum Closest
  7. Letter Combinations of a Phone Number
  8. 4Sum
  9. Remove Nth Node From End of List
  10. Valid Parentheses

21-30

  1. Merge Two Sorted Lists
  2. Generate Parentheses
  3. Merge k Sorted Lists
  4. Swap Nodes in Pairs
  5. Reverse Nodes in k-Group
  6. Remove Duplicates from Sorted Array
  7. Remove Element
  8. Implement strStr()
  9. Divide Two Integers

31-40

  1. Next Permutation
  2. Longest Valid Parentheses
  3. Search in Rotated Sorted Array
  4. Search for a Range
  5. Search Insert Position
  6. Valid Sudoku
  7. Sudoku Solver
  8. Combination Sum
  9. Combination Sum II

41-50

  1. First Missing Positive
  2. Trapping Rain Water
  3. Multiply Strings
  4. Jump Game II
  5. Permutations
  6. Permutations II
  7. Rotate Image
  8. Group Anagrams
  9. Pow(x, n)

51-60

  1. N-Queens
  2. N-Queens II
  3. Maximum Subarray
  4. Spiral Matrix
  5. Jump Game
  6. Merge Intervals
  7. Insert Interval
  8. Spiral Matrix II
  9. Permutation Sequence (Can't access article)

61-70

  1. Rotate List
  2. Unique Paths
  3. Unique Paths II
  4. Minimum Path Sum (Can't access article)
  5. Valid Number
  6. Plus One
  7. Add Binary
  8. Sqrt(x)
  9. Climbing Stairs

71-80

  1. Edit Distance (Can't access article)
  2. Set Matrix Zeroes
  3. Search a 2D Matrix (Can't access article)
  4. Sort Colors
  5. Minimum Window Substring
  6. Combinations
  7. Subsets
  8. Word Search
  9. Remove Duplicates from Sorted Array II

81-90

  1. Search in Rotated Sorted Array II
  2. Remove Duplicates from Sorted List II
  3. Remove Duplicates from Sorted List
  4. Largest Rectangle in Histogram (Can't access article)
  5. Maximal Rectangle (Can't access article)
  6. Partition List
  7. Scramble String
  8. Merge Sorted Array
  9. Gray Code
  10. Subsets II

91-100

  1. Decode Ways
  2. Reverse Linked List II
  3. Restore IP Addresses
  4. Binary Tree Inorder Traversal
  5. Unique Binary Search Trees II
  6. Unique Binary Search Trees
  7. Validate Binary Search Tree
  8. Recover Binary Search Tree
  9. Same Tree

101-110

  1. Symmetric Tree
  2. Binary Tree Level Order Traversal
  3. Binary Tree Zigzag Level Order Traversal
  4. Maximum Depth of Binary Tree
  5. Construct Binary Tree from Preorder and Inorder Traversal
  6. Construct Binary Tree from Inorder and Postorder Traversal (Can't access article)
  7. Binary Tree Level Order Traversal II
  8. Convert Sorted Array to Binary Search Tree
  9. Convert Sorted List to Binary Search Tree
  10. Balanced Binary Tree

111-120

  1. Minimum Depth of Binary Tree
  2. Path Sum
  3. Path Sum II
  4. Flatten Binary Tree to Linked List
  5. Populating Next Right Pointers in Each Node II (Can't access article)
  6. Pascal's Triangle
  7. Pascal's Triangle II
  8. Triangle

121-130

  1. Best Time to Buy and Sell Stock
  2. Best Time to Buy and Sell Stock II
  3. Best Time to Buy and Sell Stock III
  4. Binary Tree Maximum Path Sum
  5. Valid Palindrome
  6. Word Ladder II
  7. Word Ladder
  8. Longest Consecutive Sequence
  9. Sum Root to Leaf Numbers
  10. Surrounded Regions

131-140

  1. Palindrome Partitioning
  2. Palindrome Partitioning II
  3. Clone Graph
  4. Gas Station (Can't access article)
  5. Single Number
  6. Single Number II (Can't access article)
  7. Copy List with Random Pointer
  8. Word Break
  9. Word Break II

141-150

  1. Linked List Cycle
  2. Linked List Cycle II
  3. Reorder List
  4. Binary Tree Preorder Traversal
  5. Binary Tree Postorder Traversal
  6. LRU Cache
  7. Insertion Sort List
  8. Sort List
  9. Max Points on a Line (Can't access article)
  10. Evaluate Reverse Polish Notation

151-160

  1. Reverse Words in a String
  2. Maximum Product Subarray
  3. Find Minimum in Rotated Sorted Array
  4. Find Minimum in Rotated Sorted Array II
  5. Min Stack
  6. Intersection of Two Linked Lists

161-170

  1. Find Peak Element
  2. Maximum Gap
  3. Compare Version Numbers (Can't access article)
  4. Fraction to Recurring Decimal
  5. Two Sum II - Input array is sorted
  6. Excel Sheet Column Title
  7. Majority Element
  8. Two Sum III - Data structure design

171-180

  1. Excel Sheet Column Number
  2. Factorial Trailing Zeroes
  3. Binary Search Tree Iterator
  4. Dungeon Game
  5. Largest Number

181-190

  1. Repeated DNA Sequences
  2. Best Time to Buy and Sell Stock IV
  3. Rotate Array
  4. Reverse Bits

191-200

  1. Number of 1 Bits
  2. House Robber (Can't access article)
  3. Binary Tree Right Side View
  4. Number of Islands

201-210

  1. Bitwise AND of Numbers Range
  2. Happy Number
  3. Remove Linked List Elements
  4. Count Primes
  5. Isomorphic Strings
  6. Reverse Linked List
  7. Course Schedule
  8. Implement Trie (Prefix Tree)
  9. Minimum Size Subarray Sum
  10. Course Schedule II

211-220

  1. Word Search II
  2. House Robber II
  3. Kth Largest Element in an Array
  4. Combination Sum III
  5. Contains Duplicate
  6. The Skyline Problem (Can't access article)
  7. Contains Duplicate II
  8. Contains Duplicate III

221-230

  1. Maximal Square
  2. Basic Calculator
  3. Invert Binary Tree
  4. Basic Calculator II
  5. Summary Ranges (Can't access article)
  6. Majority Element II
  7. Kth Smallest Element in a BST

231-240

  1. Power of Two
  2. Palindrome Linked List
  3. Lowest Common Ancestor of a Binary Search Tree
  4. Lowest Common Ancestor of a Binary Tree
  5. Delete Node in a Linked List
  6. Product of Array Except Self
  7. Sliding Window Maximum
  8. Search a 2D Matrix II (Can't access article)

241-250

  1. Different Ways to Add Parentheses
  2. Valid Anagram

251-260

  1. Meeting Rooms
  2. Meeting Rooms II
  3. Binary Tree Paths
  4. Add Digits
  5. Single Number III

261-270

  1. Graph Valid Tree
  2. Ugly Number
  3. Ugly Number II
  4. Missing Number
  5. Alien Dictionary
  6. Closest Binary Search Tree Value

271-280

  1. Encode and Decode Strings
  2. Integer to English Words
  3. Find the Celebrity
  4. First Bad Version
  5. Perfect Squares
  6. Wiggle Sort

281-290

  1. Move Zeroes
  2. Inorder Successor in BST
  3. Find the Duplicate Number
  4. Game of Life
  5. Word Pattern

291-300

  1. Find Median from Data Stream
  2. Best Meeting Point
  3. Serialize and Deserialize Binary Tree (Can't access article)
  4. Binary Tree Longest Consecutive Sequence
  5. Bulls and Cows
  6. Longest Increasing Subsequence

301-310

  1. Remove Invalid Parentheses
  2. Range Sum Query - Immutable
  3. Range Sum Query 2D - Immutable
  4. Range Sum Query - Mutable
  5. Range Sum Query 2D - Mutable
  6. Best Time to Buy and Sell Stock with Cooldown
  7. Minimum Height Trees

311-320

  1. Sparse Matrix Multiplication
  2. Burst Balloons
  3. Super Ugly Number
  4. Count of Smaller Numbers After Self
  5. Maximum Product of Word Lengths (Can't access article)

321-330

  1. Coin Change
  2. Number of Connected Components in an Undirected Graph
  3. Wiggle Sort II
  4. Power of Three
  5. Count of Range Sum
  6. Odd Even Linked List
  7. Longest Increasing Path in a Matrix (Can't access article)

331-340

  1. Reconstruct Itinerary
  2. Increasing Triplet Subsequence
  3. Palindrome Pairs (Can't access article)
  4. House Robber III
  5. Counting Bits
  6. Nested List Weight Sum
  7. Longest Substring with At Most K Distinct Characters

341-350

  1. Flatten Nested List Iterator
  2. Power of Four
  3. Integer Break
  4. Reverse String
  5. Top K Frequent Elements

351-360

  1. Data Stream as Disjoint Intervals
  2. Russian Doll Envelopes (Can't access article)

361-370

  1. Nested List Weight Sum II
  2. Valid Perfect Square
  3. Largest Divisible Subset

371-380

  1. Sum of Two Integers
  2. Super Pow
  3. Find K Pairs with Smallest Sums
  4. Combination Sum IV
  5. Kth Smallest Element in a Sorted Matrix
  6. Insert Delete GetRandom O(1)

381-390

  1. Insert Delete GetRandom O(1) - Duplicates allowed
  2. Shuffle an Array
  3. Find the Difference

391-400

  1. Is Subsequence
  2. UTF-8 Validation
  3. Decode String
  4. Longest Substring with At Least K Repeating Characters
  5. Integer Replacement
  6. Evaluate Division
  7. Nth Digit

401-410

  1. Binary Watch
  2. Queue Reconstruction by Height
  3. Trapping Rain Water II
  4. Longest Palindrome

411-420

  1. Fizz Buzz
  2. Third Maximum Number
  3. Add Strings
  4. Partition Equal Subset Sum
  5. Pacific Atlantic Water Flow

421-430

  1. Longest Repeating Character Replacement
  2. Flatten a Multilevel Doubly Linked List

431-440

  1. Minimum Genetic Mutation
  2. Non-overlapping Intervals
  3. Find Right Interval (Can't access article)
  4. Path Sum III
  5. Find All Anagrams in a String

441-450

  1. Find All Duplicates in an Array
  2. Add Two Numbers II
  3. Find All Numbers Disappeared in an Array
  4. Delete Node in a BST (Can't access article)

451-460

  1. Sort Characters By Frequency
  2. Minimum Number of Arrows to Burst Balloons
  3. Minimum Moves to Equal Array Elements (Can't access article)
  4. 4Sum II
  5. 132 Pattern
  6. LFU Cache

461-470

  1. Minimum Moves to Equal Array Elements II (Can't access article)
  2. Island Perimeter (Can't access article)

471-480

  1. Ones and Zeroes (Can't access article)
  2. Generate Random Point in a Circle (Can't access article)
  3. Sliding Window Median (Can't access article)

481-490

  1. Predict the Winner
  2. Robot Room Cleaner

491-500

  1. Target Sum

511-520

  1. Find Bottom Left Tree Value
  2. Longest Palindromic Subsequence
  3. Coin Change 2 (Can't access article)

521-530

  1. Longest Uncommon Subsequence I
  2. Longest Uncommon Subsequence II (Can't access article)
  3. Continuous Subarray Sum (Can't access article)
  4. Contiguous Array

531-540

  1. Encode and Decode TinyURL (Can't access article)
  2. Convert BST to Greater Tree
  3. Minimum Time Difference
  4. Single Element in a Sorted Array (Can't access article)

541-550

  1. Reverse String II
  2. 01 Matrix
  3. Diameter of Binary Tree
  4. Friend Circles (Can't access article)
  5. Split Array with Equal Sum
  6. Binary Tree Longest Consecutive Sequence II

551-560

  1. Student Attendance Record I (Can't access article)
  2. Student Attendance Record II (Can't access article)
  3. Optimal Division
  4. Brick Wall
  5. Reverse Words in a String III
  6. Subarray Sum Equals K

561-570

  1. Longest Line of Consecutive One in Matrix
  2. Permutation in String

571-580

  1. Subtree of Another Tree

581-590

  1. Shortest Unsorted Continuous Subarray
  2. Delete Operation for Two Strings
  3. Find Customer Referee (database, DB)

591-600

  1. Fraction Addition and Subtraction
  2. Valid Square
  3. Non-negative Integers without Consecutive Ones

601-610

  1. Can Place Flowers

611-620

  1. Valid Triangle Number
  2. Merge Two Binary Trees
  3. Not Boring Movies (database, DB) (Can't access article)

621-630

  1. Task Scheduler (Can't access article)
  2. Maximum Product of Three Numbers
  3. Course Schedule III

631-640

  1. Find Derangements (haven't test)
  2. Design Log Storage (LogSystem)
  3. Exclusive Time of Functions
  4. Average of Levels in Binary Tree
  5. Solve the Equation

641-650

  1. Maximum Average Subarray I
  2. Maximum Length of Pair Chain
  3. Palindromic Substrings
  4. Replace Words
  5. 2 Keys Keyboard

651-660

  1. Two Sum IV - Input is a BST
  2. Find K Closest Elements
  3. Split Array into Consecutive Subsequences

661-670

  1. Maximum Width of Binary Tree
  2. Maximum Swap

671-680

  1. Valid Parenthesis String

681-690

  1. Longest Univalue Path
  2. Maximum Sum of 3 Non-Overlapping Subarrays

691-700

  1. Number of Distinct Islands
  2. Max Area of Island

711-720

  1. Subarray Product Less Than K
  2. Best Time to Buy and Sell Stock with Transaction Fee

721-730

  1. Accounts Merge

731-740

  1. Asteroid Collision
  2. Delete and Earn

751-760

  1. Set Intersection Size At Least Two
  2. Employee Free Time

761-770

  1. Partition Labels
  2. Reorganize String

771-780

  1. Basic Calculator III
  2. Sliding Puzzle (Can't access article)

781-790

  1. Cheapest Flights Within K Stops (Can't access article)

791-800

  1. All Paths From Source to Target (Can't access article)

841-850

  1. Longest Mountain in Array
  2. Hand of Straights

851-860

  1. Loud and Rich

871-880

  1. Stone Game

881-890

  1. Possible Bipartition
  2. Construct Binary Tree from Preorder and Postorder Traversal

911-920

  1. Maximum Sum Circular Subarray

941-950

  1. Validate Stack Sequences

951-960

  1. Largest Component Size by Common Factor (Can't access article)

961-970

  1. Pancake Sorting

971-980

  1. Unique Paths III

981-990

  1. Minimum Cost For Tickets
  2. Interval List Intersections

1001-1010

  1. Construct Binary Search Tree from Preorder Traversal (Can't access article)

1011-1020

  1. Convert to Base -2

1021-1030

  1. Two City Scheduling (Can't access article)

1101-1110

  1. Delete Nodes And Return Forest

1171-1180

  1. Remove Zero Sum Consecutive Nodes from Linked List

1191-1200

  1. Critical Connections in a Network (Can't access article)
  2. Minimum Knight Moves

1271-1280

  1. Count Square Submatrices with All Ones

1371-1380

  1. Replace Employee ID With The Unique Identifier (database, DB) (Can't access article)

1591-1600

  1. Build Binary Expression Tree From Infix Expression

1751-1760

  1. Recyclable and Low Fat Products (database, DB)

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

1 fork
Report repository

Releases

1 tags

Packages

No packages published

Languages