Betelgeuse

Java for Coding Interviews, Coding Competitions, Geeks, & more

This project provides data structures implementation (such as Heaps, Trees and Graphs) and their most common algorithms. It also includes examples of dynamic programming, NP complexity, concurrency, networking and more.

Data Structures

• Tree
• Binary Tree
• Binary Search Tree
• AVL to do
• Priority Queues
• n-ary Min Heap
• n-ary Max Heap
• Graphs
• Adjacency Matrix Digraph

Sorting

• Efficient Sort
• Heap Sort
• Merge Sort
• Quick Sort
• Distribution Sort
• Bucket Sort to do
• Counting Sort to do
• Radix Sort

Problems

Dynamic Programming

* Minimum Steps to One: Implementation using Memoization and DP. * Fombinatorial

Bit Manipulation

* Paying Up: Implementation using shifting operations. * Byteknights and Byteknaves: Implementation using shifting operations.