Data Structures and Algorithms in Kotlin

This is a GitHub repository containing implementations and explanations of various data structures⌝ and algorithms⌝ in Kotlin programming language. The repository covers a wide range of topics including arrays, linked lists, stacks, queues, trees, sorting algorithms, searching algorithms, and dynamic programming. Each implementation is accompanied by clear and concise code comments explaining the purpose and functionality of the code. The repository provides a great resource for anyone looking to learn or improve their understanding of data structures and algorithms using Kotlin.

Overview

• Data Structures
  • Arrays⌝
  • Hash Tables⌝
  • Linked Lists⌝
  • Stacks⌝
  • Queues⌝
  • Trees⌝
  • Graphs⌝
• Algorithms
  • Recursion⌝
    • Factorial
    • Fibonacci
    • Reverse String
  • Sorting⌝
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort
  • Searching⌝
    • Linear Search
    • Binary Search
    • BFS
    • Jump Search
    • Interpolation Search
    • Sequential Search
  • Sliding Window⌝
    • Count Max Sum Sub array
    • Length Of Longest Sub String
    • Max Sum Sub Array
• Dynamic Programming
  • Memoization⌝
  • Dynamic Fibonacci⌝
  • Climb Stairs⌝
  • Coin Change⌝
  • Edit Distance⌝
  • Knapsack Problem⌝
  • Longest Common Sub Sequense⌝
  • Matrix Chain Multiplication⌝
  • Pascal Tri Angel⌝
  • Unique Paths⌝

Get started

1. Clone or download the repository and open it on your favorite IDE. (Recommended IDE: IntelliJ IDEA)
2. Checkout the implementation and explanation of various data structures and algorithms and try them out.