93 lines
3.3 KiB
Markdown
93 lines
3.3 KiB
Markdown
# Python
|
|
|
|
## Arrays
|
|
- [Count Inversions](arrays/counting_inversions.py)
|
|
- [Majority Element](arrays/majority_element.py)
|
|
- [Rotate Array](arrays/rotate_array.py)
|
|
- [Missing Number](arrays/missing_number.py)
|
|
- [Remove duplicate items](arrays/remove_duplicates_list.py)
|
|
- [Dutch National Flag Algorithm](arrays/dutch_national_flag_algo.py)
|
|
- [Max Sub Array Sum](arrays/max_sub_array_sum.py)
|
|
|
|
## Linked Lists
|
|
- [Doubly](linked_lists/doubly.py)
|
|
- [Singly](linked_lists/singly.py)
|
|
- [Reverse List](linked_lists/reverse-linkedlist.py)
|
|
- [Middle Node](linked_lists/middle-node-linkedlist.py)
|
|
- [Cycle Detection and Removal](linked_lists/cycle-detection-and-removal-linkedlist.py)
|
|
|
|
|
|
## Dictionaries
|
|
- [Two Sum](dictionaries/two-sum.py)
|
|
|
|
## Multiplication
|
|
- [Karatsuba](multiplication/karatsuba_algorithm.py)
|
|
|
|
## Recursion
|
|
- [Factorial](recursion/factorial.py)
|
|
- [n-th Fibonacci number](recursion/nth_fibonacci_number.py)
|
|
- [Recursive Insertion Sort](recursion/recursive_insertion_sort.py)
|
|
- [Recursive Sum of n numbers](recursion/recursive-sum-of-n-numbers.py)
|
|
- [GCD by Euclid's Algorithm](recursion/gcd_using_recursion.py)
|
|
|
|
|
|
## Scheduling
|
|
- [Interval Scheduling](scheduling/interval_scheduling.py)
|
|
|
|
## Searching
|
|
- [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)
|
|
- [Uniform Cost Search](searching/uniform_cost_search.py)
|
|
- [Breath First Search](searching/breadth-first-search.py)
|
|
|
|
## Sorting
|
|
- [Bubble Sort](sorting/bubble_sort.py)
|
|
- [Comb Sort](sorting/comb_sort.py)
|
|
- [Count Sort](sorting/count-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
|
|
- [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)
|
|
- [Add String](strings/add_string.py)
|
|
- [Rabin Karp algorithm](strings/rabin-karp-algorithm.py)
|
|
- [Find all permutations](strings/find_all_permutations.py)
|
|
- [Roman to Int](strings/roman-to-int.py)
|
|
|
|
## Dynamic Programming
|
|
- [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)
|
|
- [Levenshtein distance](dynamic_programming/levenshtein_distance.py)
|
|
|
|
## Graphs
|
|
- [Simple Graph](graphs/graph.py)
|
|
- [BFS SEQUENCE](graphs/bfs-sequence.py)
|
|
- [Depth First Search](graphs/depth-first-search.py)
|
|
|
|
## Trees
|
|
- [Binary Tree](trees/binary_tree.py)
|
|
- [Binary Search Tree](trees/binary_search_tree.py)
|
|
|
|
## Queues
|
|
- [First in First out Queue](queues/fifo-queue.py)
|
|
|
|
## Number Theory
|
|
- [Prime Number Checker](number_theory/prime_number.py)
|