algs4-leprosorium

archived, look at https://github.com/solairerove/leetcode-leprosorium-python

• algs4.cs.princeton.edu
• code
• cp-algorithms
• stepik course part 1
• rosettacode
• ComparisonSort
• sorting.at
• sorting-algorithms
• leetcode

---

Kotlin

• arrays
  • array of products
  • compliance priorities
  • 💾 distinct even pair sum
  • first duplicate value
  • frequency of maximum value
  • kadane
  • largest range
  • longest peak
  • merge overlapping intervals
  • merge sorted array
  • min rewards
  • monotonic array
  • move element to the end
  • non constructable change
  • pivot index
  • smallest difference
  • sorted squared array
  • spiral traverse
  • three number sum
  • tournament winner
  • two sum
  • two sum sorted
  • validate subsequence
• binary search tree
  • construct bst from preorder traversal
  • convert sorted array to bst
  • count of smaller numbers after self
  • find the closest value
  • kth smallest element
  • same bsts
  • validate bst
• binary tree
  • branch sums
  • diameter of binary tree
  • flatten binary tree to linked list
  • inorder successor
  • inorder traversal
  • invert binary tree
  • is height balanced
  • max path sum
  • node depths
  • postorder traversal
  • preorder traversal
  • same tree
  • sum of node depths
• dynamic programming
  • coin change
  • coin change 2
  • edit distance
  • 💾 equal sum arrays with min num of ops
  • house robber
  • jump game 2
  • trapping rain water
  • unique paths
• greedy
  • height checker
  • huffman decode
  • knapsack problem
  • minimal waiting time
  • naive huffman encode
  • number partition
  • segment covering by unit
  • tandem bicycle
  • task assignment
  • valid starting city
• hash table
  • design hash map
  • design hash set
  • design twitter
  • insert delete get random O(1)
  • insert delete get random duplicates allowed O(1)
• heap
  • merge k sorted arrays
  • min heap
  • sort k sorted array
• linked list
  • add two numbers
  • add two numbers ii
  • copy list with random pointer
  • delete n nodes afters m nodes of a linked list
  • delete node in a linked list
  • delete the middle node of a linked list
  • design browser history
  • design linked list
  • find the duplicate number
  • flatten a multilevel doubly linked list
  • insert into a sorted circular linked list
  • intersection of two linked lists
  • lfu cache
  • linked list cycle
  • linked list cycle II
  • linked list random node
  • lru cache
  • merge k sorted lists
  • merge two sorted lists
  • middle of the linked list
  • odd even linked lists
  • palindrome linked list
  • partition list
  • remove duplicates from sorted linked list
  • remove duplicates from sorted linked list II
  • remove duplicates from unsorted linked list
  • remove duplicates from an unsorted linked list hacker rank
  • remove linked list elements
  • remove nodes from linked list
  • remove nth node from end of list
  • remove odd from linked list
  • reorder list
  • reverse linked list
  • reverse linked list II
  • reverse nodes in even length groups
  • reverse nodes in k group
  • rotate linked list
  • swap nodes in pairs
  • swapping nodes in a linked list
• matrix
  • 💾 biggest number of length from matrix
  • number of islands
• recursion
  • fibonacci
  • gcd
  • letter combinations of a phone number
  • permutations
  • powerset
  • product sum
  • staircase traverse
  • unique binary search trees
• searching
  • binary search
  • binary select left
  • binary select right
  • search range
  • fixed point
  • quick select
  • rotated binary search
  • search in matrix
  • third maximum number
• sorting
  • bubble sort
  • count sort
  • dutch national flag
  • heap sort
  • insertion sort
  • inversions
  • merge sort
  • merge sort bu
  • quick sort
  • quick sort 3 way
  • radix sort
  • selection sort
  • shell sort
• stack
  • balanced brackets
  • largest rectangle area
  • min stack
  • next greater element 2
  • simplify path
  • sort stack
• strings
  • caesar cipher encryptor
  • generate document
  • group anagrams
  • longest palindrome
  • longest substring without duplication
  • 💾 max distance between same pair elements in string
  • minimum chars for words
  • non repeating char pivot
  • reverse words in string
  • run length encoding
  • to binary string
  • valid ip addresses
  • valid palindrome