8000 GitHub - andregit1/leetcode-lintcode: Here are leetcode-lintcode problem solutions. Here is a repo for you can play it and share your solution. Hope you enjoy it and contribute it.
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Here are leetcode-lintcode problem solutions. Here is a repo for you can play it and share your solution. Hope you enjoy it and contribute it.

License

Notifications You must be signed in to change notification settings

andregit1/leetcode-lintcode

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Leetcode-Lintcode Solutions

Here are leetcode-lintcode problem solutions. Here is a repo for you can play it and share your solution. Hope you enjoy it and contribute it.

Look here is a ladder for you. You can play it in leetcode.

How to make contributions

Please read and follow the steps in CONTRIBUTING.md.

1. Defeat the Algorithm Interview

Requried

# Title Solution Difficulty
3 Longest Substring Without Repeating Characters Medium
5 Longest Palindromic Substring Medium
125 Valid Palindrome Easy
14 Longest Common Prefix Easy
8 String to Integer (atoi) Medium

Optional

# Title Solution Difficulty
344 Reverse String Easy
13 Roman to Integer Easy
10 Regular Expression Matching Hard

2. Breadth First Search

Requried

# Title Solution Difficulty
200 Number of Islands Medium
102 Binary Tree Level Order Traversal Medium
127 Word Ladder Medium
207 Course Schedule Medium
210 Course Schedule II Medium
133 Clone Graph Medium
297 Serialize and Deserialize Binary Tree Hard

3. Binary Search

Required

# Title Solution Difficultty
658 Find K Closest Elements Medium
33 Search in Rotated Sorted Array Medium
50 Pow(x, n) Medium
4 Median of Two Sorted Arrays Hard
29 Divide Two Integers Medium
315 Count of Smaller Numbers After Self Hard
287 Find the Duplicate Number Medium
167 Two Sum II - Input array is sorted Easy
658 Find K Closest Elements Medium

Optional

# Title Solution Difficulty
74 Search a 2D Matrix Easy
35 Search Insert Position Easy
278 First Bad Version Easy
222 Count Complete Tree Nodes Medium
69 Sqrt(x) Easy
1111 Maximum Nesting Depth of Two Valid Parentheses Strings Medium
300 Longest Increasing Subsequence Medium
327 Count of Range Sum Hard
363 Max Sum of Rectangle No Larger Than K Hard

4. Binary Tree & Divide and Conquer

Required

# Title Solution Difficultty
104 Maximum Depth of Binary Tree Easy
226 Invert Binary Tree Easy
617 Merge Two Binary Trees Easy
96 Unique Binary Search Trees Medium
173 Binary Search Tree Iterator Medium
169 Majority Element Easy
297 Serialize and Deserialize Binary Tree Hard
53 Maximum Subarray Easy
215 Kth Largest Element in an Array Medium

Optional

5. Two Pointers

Required

6 . Implicit Graph DFS

Required

7 . Hash & Heap

Required

8 . Memoization Search & Dynamic Programming

Required

9 . 4 Key Points of DP and Coordinate DP

Required

License

Please see LICENSE.

About

Here are leetcode-lintcode problem solutions. Here is a repo for you can play it and share your solution. Hope you enjoy it and contribute it.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 33.7%
  • C++ 28.5%
  • Python 25.1%
  • Go 9.6%
  • Shell 3.1%
0