forked from labuladong/fucking-algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
cd56677
commit 53cd41c
Showing
7 changed files
with
141 additions
and
159 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,107 +1,84 @@ | ||
| # Fucking algorithm | ||
|
|
||
| English translation is in progress... Some articles are still in Chinese, but most are completed. Please **star** this repo. The full translation will eventually be finished. Enjoy. | ||
|
|
||
| These articles go over different kinds of **Algorithmic Thinking**. All are based on LeetCode problems. They contain **not just the solution code for a problem, but also WHY the solution works and HOW you too can figure it out**. | ||
|
|
||
| I don't like one-liners. They can be confusing. I like clear, easily understandable code. | ||
|
|
||
| The **Gitbook** has been deployed and will sync with this branch of the repo: [https://labuladong.gitbook.io/algo-en/](https://labuladong.gitbook.io/algo-en/) | ||
|
|
||
| If you would like to clone this repo, please use following command: | ||
|
|
||
| ```shell | ||
| git clone --depth 1 --branch english https://github.com/labuladong/fucking-algorithm.git | ||
| ``` | ||
|
|
||
| This command specifies the `english` branch and will limit the depth of the clone and get rid of the Git commit history, which can be faster to clone. | ||
|
|
||
| ## Table of Contents | ||
| # Table of Content | ||
|
|
||
| * 0 . Must Read Series | ||
| * [The Framework for Learning Algorithms and intense problem solving exercises](think_like_computer/Framework%20and%20thoughts%20about%20learning%20data%20structure%20and%20algorithm.md) | ||
| * [Algs4: Recommended book for Learning Algorithms and Data Structures](think_like_computer/why_i_recommend_algs4.md) | ||
| * [An analysis of Dynamic Programming](dynamic_programming/AnalysisOfDynamicProgramming.md) | ||
| * [Dynamic Programming Q&A - What is Optimal Substructure](dynamic_programming/OptimalSubstructure.md) | ||
| * [The Framework for Backtracking Algorithm](think_like_computer/DetailsaboutBacktracking.md) | ||
| * [Binary Search in Detail: I wrote a Poem](think_like_computer/DetailedBinarySearch.md) | ||
| * [The Sliding Window Technique](think_like_computer/SlidingWindowTechnique.md) | ||
| * [Difference Between Process and Thread in Linux](common_knowledge/linuxProcess.md) | ||
| * [Some Good Online Practice Platforms](common_knowledge/OnlinePraticePlatform.md) | ||
|
|
||
| * [The Framework for Learning Algorithms and intense problem solving exercises](<think\_like\_computer/Framework and thoughts about learning data structure and algorithm.md>) | ||
| * [Algs4: Recommended book for Learning Algorithms and Data Structures](think\_like\_computer/why\_i\_recommend\_algs4.md) | ||
| * [An analysis of Dynamic Programming](dynamic\_programming/AnalysisOfDynamicProgramming.md) | ||
| * [Dynamic Programming Q\&A - What is Optimal Substructure](dynamic\_programming/OptimalSubstructure.md) | ||
| * [The Framework for Backtracking Algorithm](think\_like\_computer/DetailsaboutBacktracking.md) | ||
| * [Binary Search in Detail: I wrote a Poem](think\_like\_computer/DetailedBinarySearch.md) | ||
| * [The Sliding Window Technique](think\_like\_computer/SlidingWindowTechnique.md) | ||
| * [Difference Between Process and Thread in Linux](common\_knowledge/linuxProcess.md) | ||
| * [Some Good Online Practice Platforms](common\_knowledge/OnlinePraticePlatform.md) | ||
| * I. Dynamic Programming Series | ||
| * [Dynamic Programming in Details](dynamic_programming/AnalysisOfDynamicProgramming.md) | ||
| * [Dynamic Programming Q&A - What is Optimal Substructure](dynamic_programming/OptimalSubstructure.md) | ||
| * [Classic DP: Longest Common Subsequence](dynamic_programming/LongestCommonSubsequence.md) | ||
| * [Classic DP: Edit Distance](dynamic_programming/EditDistance.md) | ||
| * [Classic DP: Super Egg](dynamic_programming/ThrowingEggsinHighBuildings.md) | ||
| * [Classic DP: Super Egg (Advanced Solution)](dynamic_programming/SuperEggDropAdvanced.md) | ||
| * [The Strategies of Subsequence Problem](dynamic_programming/StrategiesForSubsequenceProblem.md) | ||
| * [Classic DP: Game Problems](dynamic_programming/GameProblemsInDynamicProgramming.md) | ||
| * [Greedy: Interval Scheduling](dynamic_programming/IntervalScheduling.md) | ||
| * [KMP Algorithm In Detail](dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md) | ||
| * [A solution to all Buy Time to Buy and Sell Stock Problems](dynamic_programming/BestTimeToBuyAndSellStock.md) | ||
| * [A solution to all House Robber Problems](dynamic_programming/HouseRobber.md) | ||
| * [4 Keys Keyboard](dynamic_programming/FourKeysKeyboard.md) | ||
| * [Regular Expression](dynamic_programming/RegularExpression.md) | ||
| * [Longest Increasing Subsequence](dynamic_programming/LongestIncreasingSubsequence.md) | ||
|
|
||
| * [Dynamic Programming in Details](dynamic\_programming/AnalysisOfDynamicProgramming.md) | ||
| * [Dynamic Programming Q\&A - What is Optimal Substructure](dynamic\_programming/OptimalSubstructure.md) | ||
| * [Classic DP: Longest Common Subsequence](dynamic\_programming/LongestCommonSubsequence.md) | ||
| * [Classic DP: Edit Distance](dynamic\_programming/EditDistance.md) | ||
| * [Classic DP: Super Egg](dynamic\_programming/ThrowingEggsinHighBuildings.md) | ||
| * [Classic DP: Super Egg (Advanced Solution)](dynamic\_programming/SuperEggDropAdvanced.md) | ||
| * [The Strategies of Subsequence Problem](dynamic\_programming/StrategiesForSubsequenceProblem.md) | ||
| * [Classic DP: Game Problems](dynamic\_programming/GameProblemsInDynamicProgramming.md) | ||
| * [Greedy: Interval Scheduling](dynamic\_programming/IntervalScheduling.md) | ||
| * [KMP Algorithm In Detail](dynamic\_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md) | ||
| * [A solution to all Buy Time to Buy and Sell Stock Problems](dynamic\_programming/BestTimeToBuyAndSellStock.md) | ||
| * [A solution to all House Robber Problems](dynamic\_programming/HouseRobber.md) | ||
| * [4 Keys Keyboard](dynamic\_programming/FourKeysKeyboard.md) | ||
| * [Regular Expression](dynamic\_programming/RegularExpression.md) | ||
| * [Longest Increasing Subsequence](dynamic\_programming/LongestIncreasingSubsequence.md) | ||
| * II. Data Structures Series | ||
| * [The Framework for Learning Algorithms and intense problem solving exercises](think_like_computer/Framework%20and%20thoughts%20about%20learning%20data%20structure%20and%20algorithm.md) | ||
| * [Algs4: Recommended book for Learning Algorithms and Data Structures](think_like_computer/why_i_recommend_algs4.md) | ||
| * [Binary Heap and Priority Queue](data_structure/binary_heap_implements_priority_queues.md) | ||
| * [LRU Cache Strategy in Detail](interview/LRU_algorithm.md) | ||
| * [Collections of Binary Search Operations](data_structure/The_Manipulation_Collection_of_Binary_Search_Tree.md) | ||
| * [Special Data Structure: Monotonic Stack](data_structure/MonotonicStack.md) | ||
| * [Special Data Structure: Monotonic Queue](data_structure/Monotonic_queue.md) | ||
| * [Design Twitter](data_structure/design_Twitter.md) | ||
| * [Reverse Part of Linked List via Recursion](data_structure/reverse_part_of_a_linked_list_via_recursion.md) | ||
| * [Queue Implement Stack/Stack implement Queue](data_structure/ImplementQueueUsingStacksImplementStackUsingQueues.md) | ||
|
|
||
| * [The Framework for Learning Algorithms and intense problem solving exercises](<think\_like\_computer/Framework and thoughts about learning data structure and algorithm.md>) | ||
| * [Algs4: Recommended book for Learning Algorithms and Data Structures](think\_like\_computer/why\_i\_recommend\_algs4.md) | ||
| * [Binary Heap and Priority Queue](data\_structure/binary\_heap\_implements\_priority\_queues.md) | ||
| * [LRU Cache Strategy in Detail](interview/LRU\_algorithm.md) | ||
| * [Collections of Binary Search Operations](data\_structure/The\_Manipulation\_Collection\_of\_Binary\_Search\_Tree.md) | ||
| * [Special Data Structure: Monotonic Stack](data\_structure/MonotonicStack.md) | ||
| * [Special Data Structure: Monotonic Queue](data\_structure/Monotonic\_queue.md) | ||
| * [Design Twitter](data\_structure/design\_Twitter.md) | ||
| * [Reverse Part of Linked List via Recursion](data\_structure/reverse\_part\_of\_a\_linked\_list\_via\_recursion.md) | ||
| * [Queue Implement Stack/Stack implement Queue](data\_structure/ImplementQueueUsingStacksImplementStackUsingQueues.md) | ||
| * III. Algorithmic Thinking Series | ||
| * [My Way to Learn Algorithm](think_like_computer/ThewaytoAlgorithmlearning.md) | ||
| * [The Framework of Backtracking Algorithm](think_like_computer/DetailsaboutBacktracking.md) | ||
| * [Binary Search in Detail](think_like_computer/DetailedBinarySearch.md) | ||
| * [Backtracking Solve Subset/Permutation/Combination](interview/Subset_Permutation_Combination.md) | ||
| * [Diving into the technical parts of Double Pointers](think_like_computer/double_pointer.md) | ||
| * [Sliding Window Technique](think_like_computer/SlidingWindowTechnique.md) | ||
| * [The Core Concept of TwoSum Problems](think_like_computer/The_key_to_resolving_TwoSum_problems.md) | ||
| * [Common Bit Manipulations](think_like_computer/CommonBitManipulation.md) | ||
| * [Breaking down a Complicated Problem: Implement a Calculator](data_structure/Implementing_the_functions_of_a_calculator.md) | ||
| * [Pancake Sorting Algorithm](think_like_computer/PancakesSorting.md) | ||
| * [Prefix Sum: Intro and Concept](think_like_computer/prefix_sum.md) | ||
| * [String Multiplication](think_like_computer/string_multiplication.md) | ||
| * [FloodFill Algorithm in Detail](think_like_computer/flood_fill.md) | ||
| * [Interval Scheduling: Interval Merging](think_like_computer/IntervalMerging.md) | ||
| * [Interval Scheduling: Intersections of Intervals](think_like_computer/IntervalIntersection.md) | ||
| * [Russian Doll Envelopes Problem](think_like_computer/RussianDollEnvelopes.md) | ||
| * [A collection of counter-intuitive Probability Problems](think_like_computer/several_counter_intuitive_probability_problems.md) | ||
| * [Shuffle Algorithm](think_like_computer/Shuffle_Algorithm.md) | ||
| * [Recursion In Detail](data_structure/RecursionInDetail.md) | ||
|
|
||
| * [My Way to Learn Algorithm](think\_like\_computer/ThewaytoAlgorithmlearning.md) | ||
| * [The Framework of Backtracking Algorithm](think\_like\_computer/DetailsaboutBacktracking.md) | ||
| * [Binary Search in Detail](think\_like\_computer/DetailedBinarySearch.md) | ||
| * [Backtracking Solve Subset/Permutation/Combination](interview/Subset\_Permutation\_Combination.md) | ||
| * [Diving into the technical parts of Double Pointers](think\_like\_computer/double\_pointer.md) | ||
| * [Sliding Window Technique](think\_like\_computer/SlidingWindowTechnique.md) | ||
| * [The Core Concept of TwoSum Problems](think\_like\_computer/The\_key\_to\_resolving\_TwoSum\_problems.md) | ||
| * [Common Bit Manipulations](think\_like\_computer/CommonBitManipulation.md) | ||
| * [Breaking down a Complicated Problem: Implement a Calculator](data\_structure/Implementing\_the\_functions\_of\_a\_calculator.md) | ||
| * [Pancake Sorting Algorithm](think\_like\_computer/PancakesSorting.md) | ||
| * [Prefix Sum: Intro and Concept](think\_like\_computer/prefix\_sum.md) | ||
| * [String Multiplication](think\_like\_computer/string\_multiplication.md) | ||
| * [FloodFill Algorithm in Detail](think\_like\_computer/flood\_fill.md) | ||
| * [Interval Scheduling: Interval Merging](think\_like\_computer/IntervalMerging.md) | ||
| * [Interval Scheduling: Intersections of Intervals](think\_like\_computer/IntervalIntersection.md) | ||
| * [Russian Doll Envelopes Problem](think\_like\_computer/RussianDollEnvelopes.md) | ||
| * [A collection of counter-intuitive Probability Problems](think\_like\_computer/several\_counter\_intuitive\_probability\_problems.md) | ||
| * [Shuffle Algorithm](think\_like\_computer/Shuffle\_Algorithm.md) | ||
| * [Recursion In Detail](data\_structure/RecursionInDetail.md) | ||
| * IV. High Frequency Interview Series | ||
| * [How to Implement LRU Cache](interview/LRU_algorithm.md) | ||
| * [How to Find Prime Number Efficiently](interview/Print_PrimeNumbers.md) | ||
| * [How to Calculate Minimium Edit Distance](dynamic_programming/EditDistance.md) | ||
| * [How to Implement LRU Cache](interview/LRU\_algorithm.md) | ||
| * [How to Find Prime Number Efficiently](interview/Print\_PrimeNumbers.md) | ||
| * [How to Calculate Minimium Edit Distance](dynamic\_programming/EditDistance.md) | ||
| * [How to use Binary Search](interview/UsingBinarySearchAlgorithm.md) | ||
| * [How to efficiently solve Trapping Rain Water Problem](interview/Trapping_Rain_Water.md) | ||
| * [How to efficiently solve Trapping Rain Water Problem](interview/Trapping\_Rain\_Water.md) | ||
| * [How to Remove Duplicates From Sorted Array](interview/RemoveDuplicatesfromSortedArray.md) | ||
| * [How to Find Longest Palindromic Substring](interview/TheLongestPalindromicSubstring.md) | ||
| * [How to Reverse Linked List in K Group](interview/reverse-nodes-in-k-group.md) | ||
| * [How to Check the Validation of Parenthesis](interview/valid-parentheses.md) | ||
| * [How to Find Missing Element](interview/missing_elements.md) | ||
| * [How to Find Missing Element](interview/missing\_elements.md) | ||
| * [How to Find Duplicates and Missing Elements](interview/Find-Duplicate-and-Missing-Element.md) | ||
| * [How to Check Palindromic LinkedList](interview/check_palindromic_linkedlist.md) | ||
| * [How to Check Palindromic LinkedList](interview/check\_palindromic\_linkedlist.md) | ||
| * [How to Pick Elements From an Infinite Arbitrary Sequence](interview/ReservoirSampling.md) | ||
| * [How to Schedule Seats for Students](interview/Seatscheduling.md) | ||
| * [Union-Find Algorithm in Detail](think_like_computer/Union-find-Explanation.md) | ||
| * [Union-Find Application](think_like_computer/Union-Find-Application.md) | ||
| * [Union-Find Algorithm in Detail](think\_like\_computer/Union-find-Explanation.md) | ||
| * [Union-Find Application](think\_like\_computer/Union-Find-Application.md) | ||
| * [Problems that can be solved in one line](interview/one-line-code-puzzles.md) | ||
| * [Find Subsequence With Binary Search](interview/findSebesquenceWithBinarySearch.md) | ||
|
|
||
| * V. Common Knowledge | ||
| * [Difference Between Process and Thread in Linux](common_knowledge/linuxProcess.md) | ||
| * [This is the only article you need to understand `session` and `cookie`](common_knowledge/SessionAndCookie.md) | ||
| * [Knowledge about Linux Shell that you should know](common_knowledge/linuxshell.md) | ||
| * [Cryptology Algorithm](common_knowledge/Cryptology.md) | ||
| * [Git/SQL/Good Online Practice Platforms](common_knowledge/OnlinePraticePlatform.md) | ||
| * [Difference Between Process and Thread in Linux](common\_knowledge/linuxProcess.md) | ||
| * [This is the only article you need to understand `session` and `cookie`](common\_knowledge/SessionAndCookie.md) | ||
| * [Knowledge about Linux Shell that you should know](common\_knowledge/linuxshell.md) | ||
| * [Cryptology Algorithm](common\_knowledge/Cryptology.md) | ||
| * [Git/SQL/Good Online Practice Platforms](common\_knowledge/OnlinePraticePlatform.md) |
Oops, something went wrong.