https://github.com/javadev/classic-cherries-kotlin

Implementation of some classical computer science algorithms and leetcode problems in kotlin.
https://github.com/javadev/classic-cherries-kotlin

Last synced: 5 months ago
JSON representation

Implementation of some classical computer science algorithms and leetcode problems in kotlin.

• Host: GitHub
• URL: https://github.com/javadev/classic-cherries-kotlin
• Owner: javadev
• License: apache-2.0
• Created: 2018-11-10T08:58:22.000Z (about 7 years ago)
• Default Branch: main
• Last Pushed: 2024-11-22T05:10:11.000Z (about 1 year ago)
• Last Synced: 2024-11-22T06:18:18.810Z (about 1 year ago)
• Language: Kotlin
• Size: 28.3 KB
• Stars: 5
• Watchers: 4
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
[![Java CI](https://github.com/javadev/classic-cherries-kotlin/actions/workflows/maven.yml/badge.svg)](https://github.com/javadev/classic-cherries-kotlin/actions/workflows/maven.yml)

[![codecov.io](http://codecov.io/github/javadev/classic-cherries-kotlin/coverage.svg?branch=main)](http://codecov.io/github/javadev/classic-cherries-kotlin?branch=main)

# classic-cherries-kotlin

Implementation of some classical computer science algorithms in kotlin

- Max-Heap

- Binary Search Tree

- Sorting Algorithms (heap-sort, merge-sort, quick-sort and radix-sort)

- Quick Select Algorithm (to find the kth smallest element in an unordered list)

- Backtracking (for generating subsets, permutations, solving sudoku, etc.)

- Dynamic Programming (for calculating edit distance, longest common subsequence, etc)

- 0/1 Knapsack Problem, Integer Partition (Multiset of Integers) Problem

- Graphs (BSF, DSF, all connected components, finding paths, edge classification, topological sorting)