Kotlin is all you need
Published:
This repository is for those who are new to Kotlin and want to learn it.
It contains all the basic algorithms and data structures implemented in Kotlin.
Table of Contents
Introduction (Day 1)
Data Structures (Day 2 - Day 5)
- Array
- Linked List
- Stack
- Queue
- Hash Table
- Heap
- Trie
- Graph
Sorting Algorithm (Day 6 - Day 10)
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Counting Sort
- Radix Sort
- Bucket Sort
Tree (Day 11 - Day 12)
- Binary Search Tree
- AVL Tree
- Red-Black Tree
Graph (Day 13 - Day 16)
- Breadth First Search
- Depth First Search
- Topological Sort
- Dijkstra’s Algorithm
- Bellman-Ford Algorithm
- Floyd-Warshall Algorithm
- Prim’s Algorithm
- Kruskal’s Algorithm
Dynamic Programming (Day 17 - Day 20)
- Fibonacci Sequence
- Longest Common Subsequence
- Longest Increasing Subsequence
- 0-1 Knapsack Problem
- Coin Change Problem
- Rod Cutting Problem
- Matrix Chain Multiplication
- Edit Distance
Greedy Algorithm (Day 21 - Day 24)
- Activity Selection Problem
- Huffman Coding
- Job Sequencing Problem
- Fractional Knapsack Problem
- Minimum Spanning Tree
- Shortest Path
Backtracking (Day 25 - Day 29)
- N-Queens Problem
- Sudoku Solver
- Hamiltonian Cycle
- Graph Coloring
- Subset Sum
Leave a Comment