Kotlin Data Structures & Algorithms

This repo is my way of practicing the skills needed to build solutions and solve problems with the Kotlin language and programming at large. I implemented various data structures, generally utilizing generics and often exploring multiple solutions to the same problem.

Data Structures:

• Stack

  • Interface
  • Implementation

• Queue

  • Interface
  • ArrayList Queue
  • See also * Priority Queue

• Linked Lists

  • Singly Linked List
    • Node
    • Linked List
    • Linked List Iterator
    • Test
  • Doubly Linked List
    • Node
    • Doubly Linked List

• Trees

  • Basic
    • Tree Node
    • Basic Tree
  • Binary Search
    • Binary Search attempt 1
    • Binary Search Tree
    • Binary Node
  • AVL
    • AVL Node
    • AVL Tree
    • AVL Test

• Tries

  • Trie Node
  • Trie
  • Extensions
  • Test

• Heaps

  • Collection Interface
  • Heap
  • Priority Queue

• Graphs

  • Interface
  • Adjacency List
  • Adjacency Matrix
  • Dijkstra

• Extensions

• High Order Functions

Algorithms

• Sorting
  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Radix Sort
  • Selection Sort
  • Quick Sort
    • Naive Quick Sort
    • Lomuto Quick Sort
    • Hoare Quick Sort
• Utils
• Test

Problem + Solutions

• Dynamic Programming
  • Memoization
    • Fibonacci
    • How Sum
    • Can Sum
    • Best Sum
    • Count Construct
    • Can Construct
    • All Construct
    • Grid Travelers