71 lines
2.1 KiB
Markdown
71 lines
2.1 KiB
Markdown
# 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)
|
|
|
|
## Linked Lists
|
|
|
|
1. [Doubly](linked_lists/doubly.py)
|
|
2. [Singly](linked_lists/singly.py)
|
|
3. [Reverse List](linked_lists/reverse-linkedlist.py)
|
|
|
|
## Multiplication
|
|
|
|
1. [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)
|
|
|
|
## Scheduling
|
|
|
|
1. [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)
|
|
|
|
## 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)
|
|
|
|
## 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)
|
|
|
|
## 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)
|
|
|
|
## Trees
|
|
|
|
1. [Binary Tree](trees/binary_tree.py)
|