Skip to content

algorhythms/LintCode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

163 Commits
archive
archive
 
 
java
java
 
 
.gitignore
.gitignore
 
 
Anagrams.py
Anagrams.py
 
 
Backpack II.py
Backpack II.py
 
 
Backpack.py
Backpack.py
 
 
Binary Representation.py
Binary Representation.py
 
 
Binary Search.py
Binary Search.py
 
 
Building Outline.py
Building Outline.py
 
 
Coins in a Line II.py
Coins in a Line II.py
 
 
Coins in a Line III.py
Coins in a Line III.py
 
 
Coins in a Line.py
Coins in a Line.py
 
 
Compare Strings.py
Compare Strings.py
 
 
Container With Most Water.py
Container With Most Water.py
 
 
Continuous Subarray Sum II.py
Continuous Subarray Sum II.py
 
 
Continuous Subarray Sum.py
Continuous Subarray Sum.py
 
 
Convert Expression to Polish Notation.py
Convert Expression to Polish Notation.py
 
 
Convert Expression to Reverse Polish Notation.py
Convert Expression to Reverse Polish Notation.py
 
 
Convert Integer A to Integer B.py
Convert Integer A to Integer B.py
 
 
Copy Books.py
Copy Books.py
 
 
Count of Smaller Number before itself.py
Count of Smaller Number before itself.py
 
 
Count of Smaller Number.py
Count of Smaller Number.py
 
 
Delete Digits.py
Delete Digits.py
 
 
Divide Two Integers.py
Divide Two Integers.py
 
 
Evaluate Reverse Polish Notation.py
Evaluate Reverse Polish Notation.py
 
 
Expression Evaluation.py
Expression Evaluation.py
 
 
Expression Tree Build.py
Expression Tree Build.py
 
 
Fibonacci.py
Fibonacci.py
 
 
Find Peak Element II.py
Find Peak Element II.py
 
 
Find Peak Element.py
Find Peak Element.py
 
 
Find the Connected Component in the Undirected Graph.py
Find the Connected Component in the Undirected Graph.py
 
 
Find the Missing Number.py
Find the Missing Number.py
 
 
Find the Weak Connected Component in the Directed Graph.py
Find the Weak Connected Component in the Directed Graph.py
 
 
First Bad Version.py
First Bad Version.py
 
 
First Missing Positive.py
First Missing Positive.py
 
 
Hash Function.py
Hash Function.py
 
 
Heapify.py
Heapify.py
 
 
Implement Iterator of Binary Search Tree.py
Implement Iterator of Binary Search Tree.py
 
 
Implement Queue by Stacks.py
Implement Queue by Stacks.py
 
 
Insert Node in a Binary Search Tree.py
Insert Node in a Binary Search Tree.py
 
 
Interleaving Positive and Negative Numbers.py
Interleaving Positive and Negative Numbers.py
 
 
Interval Minimum Number.py
Interval Minimum Number.py
 
 
Interval Sum II.py
Interval Sum II.py
 
 
Interval Sum.py
Interval Sum.py
 
 
Kth Largest Element.py
Kth Largest Element.py
 
 
Kth Prime Number.py
Kth Prime Number.py
 
 
LICENSE
LICENSE
 
 
LRU Cache.py
LRU Cache.py
 
 
Largest Number.py
Largest Number.py
 
 
Longest Common Subsequence.py
Longest Common Subsequence.py
 
 
Longest Common Substring.py
Longest Common Substring.py
 
 
Longest Increasing Continuous subsequence.py
Longest Increasing Continuous subsequence.py
 
 
Longest Increasing Subsequence.py
Longest Increasing Subsequence.py
 
 
Longest Palindromic Substring.py
Longest Palindromic Substring.py
 
 
Longest Substring Without Repeating Characters.py
Longest Substring Without Repeating Characters.py
 
 
Longest Substring with At Most K Distinct Characters.py
Longest Substring with At Most K Distinct Characters.py
 
 
Longest Words.py
Longest Words.py
 
 
Lowest Common Ancestor.py
Lowest Common Ancestor.py
 
 
Majority Number II.py
Majority Number II.py
 
 
Majority Number III.py
Majority Number III.py
 
 
Majority Number.py
Majority Number.py
 
 
Matrix Zigzag Traversal.py
Matrix Zigzag Traversal.py
 
 
Max Tree.py
Max Tree.py
 
 
Maximal Square.py
Maximal Square.py
 
 
Maximum Gap.py
Maximum Gap.py
 
 
Maximum Product Subarray.py
Maximum Product Subarray.py
 
 
Maximum Subarray Difference.py
Maximum Subarray Difference.py
 
 
Maximum Subarray II.py
Maximum Subarray II.py
 
 
Maximum Subarray III.py
Maximum Subarray III.py
 
 
Median II.py
Median II.py
 
 
Median.py
Median.py
 
 
Minimum Adjustment Cost.py
Minimum Adjustment Cost.py
 
 
Minimum Subarray.py
Minimum Subarray.py
 
 
Number of Airplanes in the Sky.py
Number of Airplanes in the Sky.py
 
 
Number of Islands II.py
Number of Islands II.py
 
 
Number of Islands.py
Number of Islands.py
 
 
Nuts & Bolts Problem.py
Nuts & Bolts Problem.py
 
 
Palindrome Partitioning.py
Palindrome Partitioning.py
 
 
Permutation Index II.py
Permutation Index II.py
 
 
Permutation Index.py
Permutation Index.py
 
 
Permutation Sequence.py
Permutation Sequence.py
 
 
Post Office Problem.py
Post Office Problem.py
 
 
Previous Permuation.py
Previous Permuation.py
 
 
Print Numbers by Recursion.py
Print Numbers by Recursion.py
 
 
Product of Array Exclude Itself.py
Product of Array Exclude Itself.py
 
 
README.md
README.md
 
 
Rehashing.py
Rehashing.py
 
 
Remove Node in Binary Search Tree.py
Remove Node in Binary Search Tree.py
 
 
Rotate List.py
Rotate List.py
 
 
Route Between Two Nodes in Graph.py
Route Between Two Nodes in Graph.py
 
 
Search Range in Binary Search Tree.py
Search Range in Binary Search Tree.py
 
 
Segment Tree Build.py
Segment Tree Build.py
 
 
Segment Tree Modify.py
Segment Tree Modify.py
 
 
Segment Tree Query II.py
Segment Tree Query II.py
 
 
Segment Tree Query.py
Segment Tree Query.py
 
 
Single Number III.py
Single Number III.py
 
 
Singleton.py
Singleton.py
 
 
Sliding Window Maximum.py
Sliding Window Maximum.py
 
 
Sliding Window Median.py
Sliding Window Median.py
 
 
Sort Letters by Case.py
Sort Letters by Case.py
 
 

Repository files navigation

LintCode Language License

Python in Action.

Contents

Only unique questions from LintCode are included. Duplicated questions of LeetCode are excluded, which can be found in https://github.com/idf/LeetCode instead.

Python

This repo mainly uses Python. To run in Python:

python <QuestionName>.py

If you encountered Class Already Defined compilation problem in OJ, please remove TreeNode, GraphNode or etc.

Java

Some algorithms in Python cannot pass the OJ due to OJ bugs; thus the alternative solutions in java in the exactly same algorithm are provided. To run in Java:

cd LintCode/java/src/main/java
javac <PackageName>/Solution.java
java -ea <PackageName>/Solution  # -ea: enable assertion

Notes: TLE & MLE

Failed attempts are kept in the source code as documentation, which are annotated as TLE (Time Limit Exceeds) or MLE (Memory Limit Exceeds).

Online Judges

LintCode Copyright

Most of the code are from the section tag of LintCode Copyright

About

LintCode Python

lintcode.com/en/daily/

Resources

Readme

License

Apache-2.0 license
Activity
Custom properties

Stars

285 stars

Watchers

37 watching

Forks

90 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages