docs: replace ordered lists to unordered lists (#551)
Ming Tsai
GitHub
parent
af0e766dae
commit
e08d853601
|
|
@ -23,7 +23,7 @@
|
|||
- [Glued-Linked-List](linked-lists/gl-threads.c)
|
||||
|
||||
## Maths
|
||||
- [Palindrome Number](Maths/palindrome.c)
|
||||
- [Palindrome Number](maths/palindrome.c)
|
||||
|
||||
## Queues
|
||||
- [Double Ended Queue using array](queues/double-ended-queue-using-array.c)
|
||||
|
|
|
|||
|
|
@ -1,147 +1,136 @@
|
|||
# C++
|
||||
|
||||
## Arrays
|
||||
|
||||
1. [Counting Inversions](Arrays/counting-inversions.cpp)
|
||||
2. [Dutch Flag Algorithm](Arrays/dutch-flag-algo.cpp)
|
||||
3. [Left Rotation](Arrays/left-rotation.cpp)
|
||||
4. [Max Subarray Sum](Arrays/max-subarray-sum.cpp)
|
||||
5. [Shift Negatives](Arrays/shift-negatives.cpp)
|
||||
6. [Boyer–Moore Voting Algorithm](Arrays/boyer_more.cpp)
|
||||
7. [Reverse Array](Arrays/reverse-array.cpp)
|
||||
8. [Sorted-Rotated Search Array](Arrays/search-sorted-rotated.cpp)
|
||||
9. [Fractional Knapsack](Arrays/fractional-knapsack.cpp)
|
||||
10. [Quick Selection](Arrays/quick-select.cpp)
|
||||
11. [Remove Duplicates](Arrays/remove-duplicates.cpp)
|
||||
12. [Leaders In The Array](Arrays/leaders-in-array.cpp)
|
||||
13. [Elements appear thrice In The Array](Arrays/Elements_appears_thrice.cpp)
|
||||
14. [Maximum Difference](Arrays/maximum-difference.cpp)
|
||||
15. [Occurrence of one in sorted array](Arrays/occurence-of-one-in-sorted-array.cpp)
|
||||
16. [Segregate 0s and 1s](Arrays/segregate-0-and-1.cpp)
|
||||
17. [Search insert position](Arrays/search-insert-position.cpp)
|
||||
18. [Matrix Multiplication](Arrays/matrix-multiplication.cpp)
|
||||
- [Counting Inversions](Arrays/counting-inversions.cpp)
|
||||
- [Dutch Flag Algorithm](Arrays/dutch-flag-algo.cpp)
|
||||
- [Left Rotation](Arrays/left-rotation.cpp)
|
||||
- [Max Subarray Sum](Arrays/max-subarray-sum.cpp)
|
||||
- [Shift Negatives](Arrays/shift-negatives.cpp)
|
||||
- [Boyer–Moore Voting Algorithm](Arrays/boyer_more.cpp)
|
||||
- [Reverse Array](Arrays/reverse-array.cpp)
|
||||
- [Sorted-Rotated Search Array](Arrays/search-sorted-rotated.cpp)
|
||||
- [Fractional Knapsack](Arrays/fractional-knapsack.cpp)
|
||||
- [Quick Selection](Arrays/quick-select.cpp)
|
||||
- [Remove Duplicates](Arrays/remove-duplicates.cpp)
|
||||
- [Leaders In The Array](Arrays/leaders-in-array.cpp)
|
||||
- [Elements appear thrice In The Array](Arrays/Elements_appears_thrice.cpp)
|
||||
- [Maximum Difference](Arrays/maximum-difference.cpp)
|
||||
- [Occurrence of one in sorted array](Arrays/occurence-of-one-in-sorted-array.cpp)
|
||||
- [Segregate 0s and 1s](Arrays/segregate-0-and-1.cpp)
|
||||
- [Search insert position](Arrays/search-insert-position.cpp)
|
||||
- [Matrix Multiplication](Arrays/matrix-multiplication.cpp)
|
||||
|
||||
## Dynamic-Programming
|
||||
|
||||
1. [Longest Common Subsequence](Dynamic-Programming/longest-common-subsequence.cpp)
|
||||
2. [Longest Common Substring](Dynamic-Programming/longest-common-substring.cpp)
|
||||
3. [0/1-knapsack](Dynamic-Programming/01-knapsack.cpp)
|
||||
4. [Matrix chain Multiplication](Dynamic-Programming/matrix-chain-multiplication.cpp)
|
||||
5. [Edit Distance](Dynamic-Programming/edit-distance.cpp)
|
||||
- [Longest Common Subsequence](Dynamic-Programming/longest-common-subsequence.cpp)
|
||||
- [Longest Common Substring](Dynamic-Programming/longest-common-substring.cpp)
|
||||
- [0/1-knapsack](Dynamic-Programming/01-knapsack.cpp)
|
||||
- [Matrix chain Multiplication](Dynamic-Programming/matrix-chain-multiplication.cpp)
|
||||
- [Edit Distance](Dynamic-Programming/edit-distance.cpp)
|
||||
|
||||
## Graphs
|
||||
|
||||
1. [Bellman Ford Algorithm](Graphs/bellman-ford.cpp)
|
||||
2. [kruskal Algorithm](Graphs/kruskal-algorithm.cpp)
|
||||
3. [Breadth First Search](Graphs/breadth-first-search.cpp)
|
||||
4. [Topological sort](Graphs/topological-sort.cpp)
|
||||
5. [Dfs traversal with stack](Graphs/dfs-through-stackdatastructure.cpp)
|
||||
6. [Dfs traversal with recursion](Graphs/dfs-traversal.cpp)
|
||||
7. [Connected Components](Graphs/total-connected-components.cpp)
|
||||
- [Bellman Ford Algorithm](Graphs/bellman-ford.cpp)
|
||||
- [kruskal Algorithm](Graphs/kruskal-algorithm.cpp)
|
||||
- [Breadth First Search](Graphs/breadth-first-search.cpp)
|
||||
- [Topological sort](Graphs/topological-sort.cpp)
|
||||
- [Dfs traversal with stack](Graphs/dfs-through-stackdatastructure.cpp)
|
||||
- [Dfs traversal with recursion](Graphs/dfs-traversal.cpp)
|
||||
- [Connected Components](Graphs/total-connected-components.cpp)
|
||||
|
||||
## Multiplication
|
||||
|
||||
1. [Karatsuba](Multiplication/karatsuba.cpp)
|
||||
- [Karatsuba](Multiplication/karatsuba.cpp)
|
||||
|
||||
## Linked Lists
|
||||
|
||||
1. [All possible insertions](Linked-Lists/all-possible-insertion.cpp)
|
||||
2. [Singly linked lists](Linked-Lists/singly.cpp)
|
||||
3. [doubley linked lists](Linked-Lists/doubly.cpp)
|
||||
4. [Circular linked lists](Linked-Lists/circular.cpp)
|
||||
5. [Removing Elements of given value](Linked-Lists/remove-specific-elements.cpp)
|
||||
6. [Reversing a linked lists](Linked-Lists/reverse.cpp)
|
||||
7. [Merging two sorted linked lists](Linked-Lists/merge.cpp)
|
||||
8. [Reorder List](Linked-Lists/Reorder-List.cpp)
|
||||
9. [Detecting cycle in a singly linked list](Linked-Lists/Cycle-Detection.cpp)
|
||||
10. [Find Merge Point of two singly linked list](Linked-Lists/Find-Merge-Point.cpp)
|
||||
11. [Segregate Even Odd Nodes of linked list](Linked-Lists/segregate-even-odd-nodes-of-linked-list.cpp)
|
||||
12. [Remove Duplicate in Sorted linked list](Linked-Lists/remove-duplicates-in-sorted-linked-list.cpp)
|
||||
- [All possible insertions](Linked-Lists/all-possible-insertion.cpp)
|
||||
- [Singly linked lists](Linked-Lists/singly.cpp)
|
||||
- [doubley linked lists](Linked-Lists/doubly.cpp)
|
||||
- [Circular linked lists](Linked-Lists/circular.cpp)
|
||||
- [Removing Elements of given value](Linked-Lists/remove-specific-elements.cpp)
|
||||
- [Reversing a linked lists](Linked-Lists/reverse.cpp)
|
||||
- [Merging two sorted linked lists](Linked-Lists/merge.cpp)
|
||||
- [Reorder List](Linked-Lists/Reorder-List.cpp)
|
||||
- [Detecting cycle in a singly linked list](Linked-Lists/Cycle-Detection.cpp)
|
||||
- [Find Merge Point of two singly linked list](Linked-Lists/Find-Merge-Point.cpp)
|
||||
- [Segregate Even Odd Nodes of linked list](Linked-Lists/segregate-even-odd-nodes-of-linked-list.cpp)
|
||||
- [Remove Duplicate in Sorted linked list](Linked-Lists/remove-duplicates-in-sorted-linked-list.cpp)
|
||||
|
||||
## Searching
|
||||
|
||||
1. [Linear Search](Searching/linear-search.cpp)
|
||||
2. [Jump Search](Searching/jump-search.cpp)
|
||||
3. [Binary Search](Searching/binary-search.cpp)
|
||||
4. [Finding squareroot using Binary search](Searching/sqrt-monotonic-binary-search.cpp)
|
||||
5. [KMP String Searching](Searching/kmp.cpp)
|
||||
6. [Ternary Search](Searching/Ternary-search.cpp)
|
||||
7. [Interpolation Search](Searching/interpolation-search.cpp)
|
||||
8. [Exponential Search](Searching/exponential-search.cpp)
|
||||
- [Linear Search](Searching/linear-search.cpp)
|
||||
- [Jump Search](Searching/jump-search.cpp)
|
||||
- [Binary Search](Searching/binary-search.cpp)
|
||||
- [Finding squareroot using Binary search](Searching/sqrt-monotonic-binary-search.cpp)
|
||||
- [KMP String Searching](Searching/kmp.cpp)
|
||||
- [Ternary Search](Searching/Ternary-search.cpp)
|
||||
- [Interpolation Search](Searching/interpolation-search.cpp)
|
||||
- [Exponential Search](Searching/exponential-search.cpp)
|
||||
|
||||
## Stacks
|
||||
|
||||
1. [Balancing Parenthesis](Stacks/balanced-parenthesis.cpp)
|
||||
2. [Reversing Stack](Stacks/reverse-stack.cpp)
|
||||
3. [Stack using Array](Stacks/stack-using-array.cpp)
|
||||
4. [Infix to postfix expression conversion](Stacks/infix-to-postfix.cpp)
|
||||
- [Balancing Parenthesis](Stacks/balanced-parenthesis.cpp)
|
||||
- [Reversing Stack](Stacks/reverse-stack.cpp)
|
||||
- [Stack using Array](Stacks/stack-using-array.cpp)
|
||||
- [Infix to postfix expression conversion](Stacks/infix-to-postfix.cpp)
|
||||
|
||||
## Sorting
|
||||
|
||||
1. [Bubble Sort](Sorting/bubble-sort.cpp)
|
||||
2. [Insertion Sort](Sorting/insertion-sort.cpp)
|
||||
3. [Quicksort](Sorting/quick-sort.cpp)
|
||||
4. [Selection Sort](Sorting/selection-sort.cpp)
|
||||
5. [3 way Quick Sort](Sorting/3way-quick-sort.cpp)
|
||||
6. [Bucket Sort](Sorting/bucket-sort.cpp)
|
||||
7. [Comb Sort](Sorting/comb-sort.cpp)
|
||||
8. [Counting Sort](Sorting/counting-sort.cpp)
|
||||
9. [heap Sort](Sorting/heap-sort.cpp)
|
||||
10. [Radix Sort](Sorting/radix-sort.cpp)
|
||||
11. [Shell Sort](Sorting/shell-sort.cpp)
|
||||
12. [Binary Insertion Sort](Sorting/binary-insertion-sort.cpp)
|
||||
13. [Merge Sort](Sorting/merge-sort.cpp)
|
||||
14. [Wave Sort](Sorting/wave-sort.cpp)
|
||||
15. [Cycle Sort](Sorting/cycle-sort.cpp)
|
||||
- [Bubble Sort](Sorting/bubble-sort.cpp)
|
||||
- [Insertion Sort](Sorting/insertion-sort.cpp)
|
||||
- [Quicksort](Sorting/quick-sort.cpp)
|
||||
- [Selection Sort](Sorting/selection-sort.cpp)
|
||||
- [3 way Quick Sort](Sorting/3way-quick-sort.cpp)
|
||||
- [Bucket Sort](Sorting/bucket-sort.cpp)
|
||||
- [Comb Sort](Sorting/comb-sort.cpp)
|
||||
- [Counting Sort](Sorting/counting-sort.cpp)
|
||||
- [heap Sort](Sorting/heap-sort.cpp)
|
||||
- [Radix Sort](Sorting/radix-sort.cpp)
|
||||
- [Shell Sort](Sorting/shell-sort.cpp)
|
||||
- [Binary Insertion Sort](Sorting/binary-insertion-sort.cpp)
|
||||
- [Merge Sort](Sorting/merge-sort.cpp)
|
||||
- [Wave Sort](Sorting/wave-sort.cpp)
|
||||
- [Cycle Sort](Sorting/cycle-sort.cpp)
|
||||
|
||||
## Strings
|
||||
|
||||
1. [Rabin-Karp pattern search algo](Strings/rabin-karp.cpp)
|
||||
2. [All subsequence of a string (Recursion) ](Strings/sequence.cpp)
|
||||
3. [String reversal](Strings/string-reverse.cpp)
|
||||
4. [String tokanisation](Strings/string-tokeniser.cpp)
|
||||
5. [Anagram check](Strings/anagram.cpp)
|
||||
6. [Remove occurrences from string](Strings/remove-occurrences.cpp)
|
||||
7. [Delete alternate characters in a string](Strings/delete-alternate-characters.cpp)
|
||||
8. [Print first letter of every word](Strings/print-first-letter.cpp)
|
||||
9. [Display longest name in a string array](Strings/longest-name.cpp)
|
||||
10. [Boyer Moore pattern search](Strings/Boyer_Moore.cpp)
|
||||
- [Rabin-Karp pattern search algo](Strings/rabin-karp.cpp)
|
||||
- [All subsequence of a string (Recursion) ](Strings/sequence.cpp)
|
||||
- [String reversal](Strings/string-reverse.cpp)
|
||||
- [String tokanisation](Strings/string-tokeniser.cpp)
|
||||
- [Anagram check](Strings/anagram.cpp)
|
||||
- [Remove occurrences from string](Strings/remove-occurrences.cpp)
|
||||
- [Delete alternate characters in a string](Strings/delete-alternate-characters.cpp)
|
||||
- [Print first letter of every word](Strings/print-first-letter.cpp)
|
||||
- [Display longest name in a string array](Strings/longest-name.cpp)
|
||||
- [Boyer Moore pattern search](Strings/Boyer_Moore.cpp)
|
||||
|
||||
## Trees
|
||||
- [Creating Binary Tree](Trees/build-binary-tree.cpp)
|
||||
- [Counting and finding sum of all the nodes in BST](Trees/count-and-sum-of-nodes-in-binary-tree.cpp)
|
||||
- [Level Order Traversal](Trees/level-order-traversal.cpp)
|
||||
- [Depth first Traversal](Trees/pre-in-post-traversal.cpp)
|
||||
- [Binary Search Tree](Trees/binary-search-tree.cpp)
|
||||
- [In order morris traversal](Trees/in-order-morris-traversal.cpp)
|
||||
- [In order Predecessor and Successor](Trees/in-order-predecessor-and-successor.cpp)
|
||||
- [Avl Tree](Trees/avl.cpp)
|
||||
- [Min Heap](Trees/min-heap.cpp)
|
||||
- [Finding the height of a given tree](Trees/Height-Of-Tree.cpp)
|
||||
- [Finding the elements of a tree visible from top view](Trees/Top-View-Of-A-Tree.cpp)
|
||||
- [Binary Tree Implementation](Trees/binary-tree-implementation.cpp)
|
||||
- [Iterative Segment Tree](Trees/IterativeSegmentTree.cpp)
|
||||
|
||||
1. [Creating Binary Tree](Trees/build-binary-tree.cpp)
|
||||
2. [Counting and finding sum of all the nodes in BST](Trees/count-and-sum-of-nodes-in-binary-tree.cpp)
|
||||
3. [Level Order Traversal](Trees/level-order-traversal.cpp)
|
||||
4. [Depth first Traversal](Trees/pre-in-post-traversal.cpp)
|
||||
5. [Binary Search Tree](Trees/binary-search-tree.cpp)
|
||||
6. [In order morris traversal](Trees/in-order-morris-traversal.cpp)
|
||||
7. [In order Predecessor and Successor](Trees/in-order-predecessor-and-successor.cpp)
|
||||
8. [Avl Tree](Trees/avl.cpp)
|
||||
9. [Min Heap](Trees/min-heap.cpp)
|
||||
10. [Finding the height of a given tree](Trees/Height-Of-Tree.cpp)
|
||||
11. [Finding the elements of a tree visible from top view](Trees/Top-View-Of-A-Tree.cpp)
|
||||
12. [Binary Tree Implementation](Trees/binary-tree-implementation.cpp)
|
||||
13. [Iterative Segment Tree](Trees/IterativeSegmentTree.cpp)
|
||||
# Maths
|
||||
|
||||
1. [Kaprekar Number](Maths/Kaprekar-number.cpp)
|
||||
2. [Prime Number](Maths/prime-check.cpp)
|
||||
3. [Prime Sieve](Maths/prime-sieve.cpp)
|
||||
4. [Fibonacci Series](Maths/fibonaccci-series.cpp)
|
||||
5. [Binomial Coefficient](Maths/binomial-coefficient.cpp)
|
||||
6. [Armstrong Number](Maths/armstrong.cpp)
|
||||
7. [Palindrome](Maths/palindrome.cpp)
|
||||
8. [Reverse digit of a number](Maths/reverse-digits.cpp)
|
||||
9. [Missing number](Maths/missing-number.cpp)
|
||||
10. [Factorial of a number](Maths/factorial.cpp)
|
||||
11. [Prime-number](Maths/prime-number.cpp)
|
||||
- [Kaprekar Number](Maths/Kaprekar-number.cpp)
|
||||
- [Prime Number](Maths/prime-check.cpp)
|
||||
- [Prime Sieve](Maths/prime-sieve.cpp)
|
||||
- [Fibonacci Series](Maths/fibonaccci-series.cpp)
|
||||
- [Binomial Coefficient](Maths/binomial-coefficient.cpp)
|
||||
- [Armstrong Number](Maths/armstrong.cpp)
|
||||
- [Palindrome](Maths/palindrome.cpp)
|
||||
- [Reverse digit of a number](Maths/reverse-digits.cpp)
|
||||
- [Missing number](Maths/missing-number.cpp)
|
||||
- [Factorial of a number](Maths/factorial.cpp)
|
||||
- [Prime-number](Maths/prime-number.cpp)
|
||||
|
||||
# Recursion
|
||||
|
||||
1. [Tower of Hanoi](Recursion/towerofHanoi.cpp)
|
||||
2. [Factorial](Recursion/factorial.cpp)
|
||||
3. [Permutation](Recursion/permutation.cpp)
|
||||
4. [GCD/HCF of two numbers](Recursion/GCD-of-two-numbers.cpp)
|
||||
5. [Sum of all elements of an array](Recursion/Sum-of-all-elements-in-an-array.cpp)
|
||||
6. [Decimal number to Binary conversion](Recursion/decimal-to-binary-conversion.cpp)
|
||||
7. [Sum of digits of a decimal integer](Recursion/sum-of-digits-of-an-integer.cpp)
|
||||
- [Tower of Hanoi](Recursion/towerofHanoi.cpp)
|
||||
- [Factorial](Recursion/factorial.cpp)
|
||||
- [Permutation](Recursion/permutation.cpp)
|
||||
- [GCD/HCF of two numbers](Recursion/GCD-of-two-numbers.cpp)
|
||||
- [Sum of all elements of an array](Recursion/Sum-of-all-elements-in-an-array.cpp)
|
||||
- [Decimal number to Binary conversion](Recursion/decimal-to-binary-conversion.cpp)
|
||||
- [Sum of digits of a decimal integer](Recursion/sum-of-digits-of-an-integer.cpp)
|
||||
|
|
|
|||
|
|
@ -2,22 +2,22 @@
|
|||
For running the `.cs` file please using [.Net Finddle](https://dotnetfiddle.net/)
|
||||
|
||||
## Arrays
|
||||
1. [Single Number](src/Arrays/single-number.cs)
|
||||
- [Single Number](src/Arrays/single-number.cs)
|
||||
|
||||
## Dynamic Programming
|
||||
1. [Longest Common Subsequence](src/Dynamic-Programming/longest-common-subsequence.cs)
|
||||
- [Longest Common Subsequence](src/Dynamic-Programming/longest-common-subsequence.cs)
|
||||
|
||||
## Number Theory
|
||||
1. [Big Mod Algorithm](src/Number-Theory/big-mod.cs)
|
||||
2. [Sieve of Eratosthenes](src/Number-Theory/sieve-of-eratosthenes.cs)
|
||||
3. [Bitwise Sieve of Eratosthenes](src/Number-Theory/bitwise-sieve-of-eratosthenes.cs)
|
||||
- [Big Mod Algorithm](src/Number-Theory/big-mod.cs)
|
||||
- [Sieve of Eratosthenes](src/Number-Theory/sieve-of-eratosthenes.cs)
|
||||
- [Bitwise Sieve of Eratosthenes](src/Number-Theory/bitwise-sieve-of-eratosthenes.cs)
|
||||
|
||||
## Sorts
|
||||
1. [Bubble Sort](src/Sorts/bubble-sort.cs)
|
||||
2. [Insertion Sort](src/Sorts/insertion-sort.cs)
|
||||
3. [Selection Sort](src/Sorts/selection-sort.cs)
|
||||
4. [Counting Sort](src/Sorts/counting-sort.cs)
|
||||
5. [Merge Sort](src/Sorts/merge-sort.cs)
|
||||
- [Bubble Sort](src/Sorts/bubble-sort.cs)
|
||||
- [Insertion Sort](src/Sorts/insertion-sort.cs)
|
||||
- [Selection Sort](src/Sorts/selection-sort.cs)
|
||||
- [Counting Sort](src/Sorts/counting-sort.cs)
|
||||
- [Merge Sort](src/Sorts/merge-sort.cs)
|
||||
|
||||
## Strings
|
||||
- [Palindrome](src/Strings/palindrome.cs)
|
||||
|
|
@ -40,4 +40,4 @@ For running the `.cs` file please using [.Net Finddle](https://dotnetfiddle.net/
|
|||
- [Depth First Search](src/Graph/depth-first-search.cs)
|
||||
- [Kruskals Algorithm to Find Minimum Spanning Tree](src/Graph/kruskals-algorithm.cs)
|
||||
- [Dijkstras Algorithm to Find Shortest Path](src/Graph/dijkstra.cs)
|
||||
- [Floyd Warshalls Algorithm to Find All Pair Shortest Path](src/Graph/floyd-warshall-algorithm.cs)
|
||||
- [Floyd Warshalls Algorithm to Find All Pair Shortest Path](src/Graph/floyd-warshall-algorithm.cs)
|
||||
|
|
|
|||
|
|
@ -1,27 +1,27 @@
|
|||
# Go
|
||||
|
||||
## Arrays
|
||||
1. [Maximum subarray sum (Kadane's Algorithm)](arrays/maximum-subarray-sum.go)
|
||||
2. [Two Sum](arrays/two-sum.go)
|
||||
3. [Majority Element](arrays/majority_element.go)
|
||||
4. [Contains Duplicate](arrays/contains_duplicate.go)
|
||||
5. [Single Number](arrays/single-number.go)
|
||||
- [Maximum subarray sum (Kadane's Algorithm)](arrays/maximum-subarray-sum.go)
|
||||
- [Two Sum](arrays/two-sum.go)
|
||||
- [Majority Element](arrays/majority_element.go)
|
||||
- [Contains Duplicate](arrays/contains_duplicate.go)
|
||||
- [Single Number](arrays/single-number.go)
|
||||
|
||||
## Scheduling
|
||||
1. [Interval Scheduling](scheduling/interval-scheduling.go)
|
||||
- [Interval Scheduling](scheduling/interval-scheduling.go)
|
||||
|
||||
## Searching
|
||||
1. [Binary Search](searching/binary-search.go)
|
||||
2. [Linear Search](searching/linear-search.go)
|
||||
3. [Find Minimum in Rotated Sorted Array](searching/rotated-array-search.go)
|
||||
- [Binary Search](searching/binary-search.go)
|
||||
- [Linear Search](searching/linear-search.go)
|
||||
- [Find Minimum in Rotated Sorted Array](searching/rotated-array-search.go)
|
||||
|
||||
## Sorting
|
||||
1. [Bubble Sort](sorting/bubble-sort.go)
|
||||
2. [Insertion Sort](sorting/insertion-sort.go)
|
||||
3. [Quicksort](sorting/quicksort.go)
|
||||
- [Bubble Sort](sorting/bubble-sort.go)
|
||||
- [Insertion Sort](sorting/insertion-sort.go)
|
||||
- [Quicksort](sorting/quicksort.go)
|
||||
|
||||
## Recursion
|
||||
1. [Fibonacci](recursion/fibonacci.go)
|
||||
- [Fibonacci](recursion/fibonacci.go)
|
||||
|
||||
## String
|
||||
1. [Palindrome Permutation](strings/palindrome-permutation.go)
|
||||
- [Palindrome Permutation](strings/palindrome-permutation.go)
|
||||
|
|
|
|||
|
|
@ -1,6 +1,5 @@
|
|||
# Haskell
|
||||
|
||||
## Strings
|
||||
|
||||
1. [Palindrome Check](strings/palindrome.hs)
|
||||
2. [All subsequences](strings/sequence.hs)
|
||||
- [Palindrome Check](strings/palindrome.hs)
|
||||
- [All subsequences](strings/sequence.hs)
|
||||
|
|
|
|||
|
|
@ -1,87 +1,76 @@
|
|||
# Java
|
||||
|
||||
## Arrays
|
||||
|
||||
1. [Counting Inversions](arrays/counting-inversions.java)
|
||||
2. [Kadanes Algorithm](arrays/kadanes-algorithm.java)
|
||||
3. [Left Rotation](arrays/left-rotation.java)
|
||||
4. [Unique Digits of Large Number](arrays/unique-digits-of-large-number.java)
|
||||
5. [Majority Element](arrays/majority-element.java)
|
||||
6. [Longest Consecutive Subsequence](arrays/longest-consecutive-subsequence.java)
|
||||
7. [K-th Element of Two Sorted Arrays](arrays/kth-element-2sorted-array.java)
|
||||
8. [Trapping Rain Water](arrays/trapping-rain-water.java)
|
||||
- [Counting Inversions](arrays/counting-inversions.java)
|
||||
- [Kadanes Algorithm](arrays/kadanes-algorithm.java)
|
||||
- [Left Rotation](arrays/left-rotation.java)
|
||||
- [Unique Digits of Large Number](arrays/unique-digits-of-large-number.java)
|
||||
- [Majority Element](arrays/majority-element.java)
|
||||
- [Longest Consecutive Subsequence](arrays/longest-consecutive-subsequence.java)
|
||||
- [K-th Element of Two Sorted Arrays](arrays/kth-element--orted-array.java)
|
||||
- [Trapping Rain Water](arrays/trapping-rain-water.java)
|
||||
|
||||
## Graphs
|
||||
|
||||
1. [Dijkstras](graphs/dijkstras.java)
|
||||
- [Dijkstras](graphs/Dijkstras.java)
|
||||
|
||||
## Linked Lists
|
||||
|
||||
1. [Circular](linked-lists/circular.java)
|
||||
2. [Clone Linked List](linked-lists/clone-linkedlist.java)
|
||||
3. [Doubly](linked-lists/doubly.java)
|
||||
4. [Reverse](linked-lists/reverse.java)
|
||||
5. [Singly](linked-lists/singly.java)
|
||||
6. [Fold Linked List](linked-lists/fold-linked-list.java)
|
||||
- [Circular](linked-lists/circular.java)
|
||||
- [Clone Linked List](linked-lists/clone-linkedlist.java)
|
||||
- [Doubly](linked-lists/doubly.java)
|
||||
- [Reverse](linked-lists/reverse.java)
|
||||
- [Singly](linked-lists/singly.java)
|
||||
- [Fold Linked List](linked-lists/fold-linked-list.java)
|
||||
|
||||
## Maths
|
||||
|
||||
1. [Factorial](Maths/factorial_using_big_integer.java)
|
||||
- [Factorial](Maths/factorial_using_big_integer.java)
|
||||
|
||||
## Queues
|
||||
|
||||
1. [Circular Queue using Linked List](queues/circular-queue-linked-list.java)
|
||||
2. [Queue using Linked List](queues/queue-linked-list.java)
|
||||
- [Circular Queue using Linked List](queues/circular-queue-linked-list.java)
|
||||
- [Queue using Linked List](queues/queue-linked-list.java)
|
||||
|
||||
## Scheduling
|
||||
|
||||
1. [Multi-Level Queue Scheduling](scheduling/multi-level-queue-scheduling.java)
|
||||
2. [Rund Robin](scheduling/round-robin.java)
|
||||
- [Multi-Level Queue Scheduling](scheduling/multi-level-queue-scheduling.java)
|
||||
- [Rund Robin](scheduling/round-robin.java)
|
||||
|
||||
## Searching
|
||||
|
||||
1. [Binary Search](searching/binary-search.java)
|
||||
2. [Jump Search](searching/jump-search.java)
|
||||
3. [Linear Search](searching/linear-search.java)
|
||||
4. [Allocate minimum number of pages](searching/allocate-min-pages.java)
|
||||
5. [Exponential Search](searching/Exponential-search.java)
|
||||
6. [Interpolation Search](searching/interpolation-search.java)
|
||||
- [Binary Search](searching/binary-search.java)
|
||||
- [Jump Search](searching/jump-search.java)
|
||||
- [Linear Search](searching/linear-search.java)
|
||||
- [Allocate minimum number of pages](searching/allocate-min-pages.java)
|
||||
- [Exponential Search](searching/Exponential-search.java)
|
||||
- [Interpolation Search](searching/interpolation-search.java)
|
||||
|
||||
## Sorting
|
||||
|
||||
1. [Bubble Sort](sorting/bubble-sort.java)
|
||||
2. [Counting Sort](sorting/counting-sort.java)
|
||||
3. [Heap Sort](sorting/heap-sort.java)
|
||||
4. [Insertion Sort](sorting/insertion-sort.java)
|
||||
5. [Merge Sort](sorting/merge-sort.java)
|
||||
6. [Quick Sort](sorting/quick-sort.java)
|
||||
7. [Selection Sort](sorting/selection-sort.java)
|
||||
8. [Shell Sort](sorting/shell-sort.java)
|
||||
9. [Cyclic Sort](sorting/cyclic-sort.java)
|
||||
- [Bubble Sort](sorting/bubble-sort.java)
|
||||
- [Counting Sort](sorting/counting-sort.java)
|
||||
- [Heap Sort](sorting/heap-sort.java)
|
||||
- [Insertion Sort](sorting/insertion-sort.java)
|
||||
- [Merge Sort](sorting/merge-sort.java)
|
||||
- [Quick Sort](sorting/quick-sort.java)
|
||||
- [Selection Sort](sorting/selection-sort.java)
|
||||
- [Shell Sort](sorting/shell-sort.java)
|
||||
- [Cyclic Sort](sorting/cyclic-sort.java)
|
||||
|
||||
## Stacks
|
||||
|
||||
1. [Balanced Parenthesis](stacks/balanced-paranthesis.java)
|
||||
2. [Stack](stacks/stack.java)
|
||||
3. [The Stock Span Problem](stacks/the-stock-span-problem.java)
|
||||
4. [Celebrity Problem](stacks/celebrity-problem.java)
|
||||
5. [Sliding Window Maximum](stacks/sliding-window-maximum.java)
|
||||
- [Balanced Parenthesis](stacks/balanced-paranthesis.java)
|
||||
- [Stack](stacks/stack.java)
|
||||
- [The Stock Span Problem](stacks/the-stock-span-problem.java)
|
||||
- [Celebrity Problem](stacks/celebrity-problem.java)
|
||||
- [Sliding Window Maximum](stacks/sliding-window-maximum.java)
|
||||
|
||||
## Strings
|
||||
|
||||
1. [KMP](strings/kmp.java)
|
||||
2. [Palindrome](strings/palindrome.java)
|
||||
3. [Rabin Krap](strings/rabin-karp.java)
|
||||
4. [Sequence](strings/sequence.java)
|
||||
5. [Split String](strings/SplitString.java)
|
||||
6. [Tokenizer](strings/tokenizer.java)
|
||||
7. [Anagram](strings/anagram.java)
|
||||
8. [Longest Common Substring](strings/Longest_common_substring.java)
|
||||
9. [Boyer Moore Search](strings/Boyer_Moore.java)
|
||||
- [KMP](strings/kmp.java)
|
||||
- [Palindrome](strings/palindrome.java)
|
||||
- [Rabin Krap](strings/rabin-karp.java)
|
||||
- [Sequence](strings/sequence.java)
|
||||
- [Split String](strings/SplitString.java)
|
||||
- [Tokenizer](strings/tokenizer.java)
|
||||
- [Anagram](strings/anagram.java)
|
||||
- [Longest Common Substring](strings/Longest_common_substring.java)
|
||||
- [Boyer Moore Search](strings/Boyer_Moore.java)
|
||||
|
||||
## Trees
|
||||
|
||||
1. [Pre in Post Traversal](trees/pre-in-post-traversal.java)
|
||||
2. [Left View of a Tree](trees/left-view.java)
|
||||
3. [Right View of a Tree](trees/right-view.java)
|
||||
4. [Zig-Zag Traversal of a Tree](trees/zig-zag-traversal.java)
|
||||
- [Pre in Post Traversal](trees/pre-in-post-traversal.java)
|
||||
- [Left View of a Tree](trees/left-view.java)
|
||||
- [Right View of a Tree](trees/right-view.java)
|
||||
- [Zig-Zag Traversal of a Tree](trees/zig-zag-traversal.java)
|
||||
|
|
|
|||
|
|
@ -1,25 +1,24 @@
|
|||
# JavaScript
|
||||
|
||||
## Arrays
|
||||
1. [Counting Inversions](src/arrays/counting-inversions.js)
|
||||
- [Counting Inversions](src/arrays/counting-inversions.js)
|
||||
|
||||
## Linked Lists
|
||||
1. [Singly](src/linked-lists/singly.js)
|
||||
1. [Doubly](src/linked-lists/doubly.js)
|
||||
- [Singly](src/linked-lists/singly.js)
|
||||
- [Doubly](src/linked-lists/doubly.js)
|
||||
|
||||
|
||||
## Searching
|
||||
1. [Binary Search Recursive](src/searching/binary-search-recursive.js)
|
||||
2. [Binary Search](src/searching/binary-search.js)
|
||||
3. [Linear Search](src/searching/linear-search.js)
|
||||
- [Binary Search Recursive](src/searching/binary-search-recursive.js)
|
||||
- [Binary Search](src/searching/binary-search.js)
|
||||
- [Linear Search](src/searching/linear-search.js)
|
||||
|
||||
## Sorting
|
||||
1. [Bubble Sort](src/sorting/bubble-sort.js)
|
||||
2. [Insertion Sort](src/sorting/insertion-sort.js)
|
||||
3. [Merge Sort](src/sorting/merge-sort.js)
|
||||
4. [Quick Sort](src/sorting/quick-sort.js)
|
||||
5. [Selection Sort](src/sorting/selection-sort.js)
|
||||
- [Bubble Sort](src/sorting/bubble-sort.js)
|
||||
- [Insertion Sort](src/sorting/insertion-sort.js)
|
||||
- [Merge Sort](src/sorting/merge-sort.js)
|
||||
- [Quick Sort](src/sorting/quick-sort.js)
|
||||
- [Selection Sort](src/sorting/selection-sort.js)
|
||||
|
||||
## Strings
|
||||
1. [Palindrome](src/strings/palindrome.js)
|
||||
2. [Sequence](src/strings/sequence.js)
|
||||
- [Palindrome](src/strings/palindrome.js)
|
||||
- [Sequence](src/strings/sequence.js)
|
||||
|
|
|
|||
|
|
@ -1,71 +1,61 @@
|
|||
# Python
|
||||
|
||||
## Arrays
|
||||
|
||||
1. [Count Inversions](arrays/counting_inversions.py)
|
||||
2. [Majority Element](arrays/majority_element.py)
|
||||
3. [Rotate Array](arrays/rotate_array.py)
|
||||
4. [Missing Number](arrays/missing_number.py)
|
||||
- [Count Inversions](arrays/counting_inversions.py)
|
||||
- [Majority Element](arrays/majority_element.py)
|
||||
- [Rotate Array](arrays/rotate_array.py)
|
||||
- [Missing Number](arrays/missing_number.py)
|
||||
|
||||
## Linked Lists
|
||||
|
||||
1. [Doubly](linked_lists/doubly.py)
|
||||
2. [Singly](linked_lists/singly.py)
|
||||
3. [Reverse List](linked_lists/reverse-linkedlist.py)
|
||||
- [Doubly](linked_lists/doubly.py)
|
||||
- [Singly](linked_lists/singly.py)
|
||||
- [Reverse List](linked_lists/reverse-linkedlist.py)
|
||||
|
||||
## Multiplication
|
||||
|
||||
1. [Karatsuba](multiplication/karatsuba.py)
|
||||
- [Karatsuba](multiplication/karatsuba.py)
|
||||
|
||||
## Recursion
|
||||
|
||||
1. [Factorial](recursion/factorial.py)
|
||||
2. [n-th Fibonacci number](recursion/n-th_fibonacci_number.py)
|
||||
3. [Recursive Insertion Sort](recursion/recursive_insertion_sort.py)
|
||||
- [Factorial](recursion/factorial.py)
|
||||
- [n-th Fibonacci number](recursion/n-th_fibonacci_number.py)
|
||||
- [Recursive Insertion Sort](recursion/recursive_insertion_sort.py)
|
||||
|
||||
## Scheduling
|
||||
|
||||
1. [Interval Scheduling](scheduling/interval_scheduling.py)
|
||||
- [Interval Scheduling](scheduling/interval_scheduling.py)
|
||||
|
||||
## Searching
|
||||
|
||||
1. [Binary Search](searching/binary_search.py)
|
||||
2. [Jump Search](searching/jump_search.py)
|
||||
3. [Linear Search](searching/linear_search.py)
|
||||
4. [Ternary Search](searching/ternary_search.py)
|
||||
5. [Interpolation Search](searching/interpolation_search.py)
|
||||
- [Binary Search](searching/binary_search.py)
|
||||
- [Jump Search](searching/jump_search.py)
|
||||
- [Linear Search](searching/linear_search.py)
|
||||
- [Ternary Search](searching/ternary_search.py)
|
||||
- [Interpolation Search](searching/interpolation_search.py)
|
||||
|
||||
## Sorting
|
||||
|
||||
1. [Bubble Sort](sorting/bubble_sort.py)
|
||||
2. [Comb Sort](sorting/comb_sort.py)
|
||||
3. [Insertion Sort](sorting/insertion_sort.py)
|
||||
4. [Quicksort](sorting/quicksort.py)
|
||||
5. [Selection Sort](sorting/selection_sort.py)
|
||||
6. [Heap Sort](sorting/heap-sort.py)
|
||||
7. [Radix Sort](sorting/radix_sort.py)
|
||||
8. [Shell Sort](sorting/shell-sort.py)
|
||||
9. [Merge sort](sorting/merge_sort.py)
|
||||
- [Bubble Sort](sorting/bubble_sort.py)
|
||||
- [Comb Sort](sorting/comb_sort.py)
|
||||
- [Insertion Sort](sorting/insertion_sort.py)
|
||||
- [Quicksort](sorting/quicksort.py)
|
||||
- [Selection Sort](sorting/selection_sort.py)
|
||||
- [Heap Sort](sorting/heap-sort.py)
|
||||
- [Radix Sort](sorting/radix_sort.py)
|
||||
- [Shell Sort](sorting/shell-sort.py)
|
||||
- [Merge sort](sorting/merge_sort.py)
|
||||
|
||||
## Strings
|
||||
|
||||
1. [Is Good Str](strings/is_good_str.py)
|
||||
2. [Palindrome](strings/palindrome.py)
|
||||
3. [Word Count](strings/word_count.py)
|
||||
4. [Remove Duplicates from a String](strings/remove_duplicates_from_a_string.py)
|
||||
5. [First Non Repeating Character](strings/first_non_repeating_character.py)
|
||||
6. [Longest Common Subsequence](strings/longest_common_subsequence.py)
|
||||
7. [Unique Character](strings/unique_character.py)
|
||||
- [Is Good Str](strings/is_good_str.py)
|
||||
- [Palindrome](strings/palindrome.py)
|
||||
- [Word Count](strings/word_count.py)
|
||||
- [Remove Duplicates from a String](strings/remove_duplicates_from_a_string.py)
|
||||
- [First Non Repeating Character](strings/first_non_repeating_character.py)
|
||||
- [Longest Common Subsequence](strings/longest_common_subsequence.py)
|
||||
- [Unique Character](strings/unique_character.py)
|
||||
|
||||
## Dynamic Programming
|
||||
|
||||
1. [Print Fibonacci Series Up To N-th Term](dynamic_programming/fibonacci_series.py)
|
||||
2. [Sum Up To N-th Term Of Fibonacci Series](dynamic_programming/fibonacci_series_sum.py)
|
||||
3. [N-th Term Of Fibonacci Series](dynamic_programming/fibonacci_series_nth_term.py)
|
||||
4. [Catalan Sequence](dynamic_programming/catalan_sequence.py)
|
||||
5. [0/1 Knapsack Problem](dynamic_programming/knapsack.py)
|
||||
- [Print Fibonacci Series Up To N-th Term](dynamic_programming/fibonacci_series.py)
|
||||
- [Sum Up To N-th Term Of Fibonacci Series](dynamic_programming/fibonacci_series_sum.py)
|
||||
- [N-th Term Of Fibonacci Series](dynamic_programming/fibonacci_series_nth_term.py)
|
||||
- [Catalan Sequence](dynamic_programming/catalan_sequence.py)
|
||||
- [0/1 Knapsack Problem](dynamic_programming/knapsack.py)
|
||||
|
||||
## Trees
|
||||
|
||||
1. [Binary Tree](trees/binary_tree.py)
|
||||
2. [Binary Search Tree](trees/binary-search-tree.py)
|
||||
- [Binary Tree](trees/binary_tree.py)
|
||||
- [Binary Search Tree](trees/binary-search-tree.py)
|
||||
|
|
|
|||
|
|
@ -1,5 +1,8 @@
|
|||
|
||||
# Rust
|
||||
|
||||
1. [Palindrome Check](strings/palindrome/README.md)
|
||||
2. [Merge Sort](sorting/merge-sort/README.md)
|
||||
# Strings
|
||||
- [Palindrome Check](strings/palindrome/README.md)
|
||||
|
||||
# Sorting
|
||||
- [Merge Sort](sorting/merge-sort/README.md)
|
||||
|
|
|
|||
Loading…
Reference in New Issue