ForFer/Hackerrank-and-learning-bits

Hackerrank challenges

Hackerrank & learning bits

Different challenges of hackerrank, with the objective of both, learning how to code better, implement better solutions, and develop my problem solving skills. Every challenge will have the problem description, alongside the input and output expected for the base case

Most of the solutions (if not all) will be in python.

List of important implementations:

Sorting

• Quicksort

• Insertion sort

• Bubble sort

• Heapsort

• Mergesort

Trees

• Binary tree

• Fenwick/Binary indexed tree (Clear, with examples)

• Fenwick/Binary indexed tree (with a hackerrank problem)

• Heap (min)

• Fibonacci Heap (min) {On progress}

• Heap for Prim's Algorithm {On Progress}

Graphs

• Kruskal's algorithm

• Graph implementation using classes

• Graph implementation using adjacency matrix

• Prim's algorithm (same as graph with adjacency matrix)

• Floyd-Warshal

• Bellman-Ford

• Dijkstra

Machine learning

• Classification and Regrestion Tree (CART)

• Linear regression

• Non linear regression

• Support vector regression (non-linear)

Others

• Idiomatic python --> source

• Prime checker in O(sqrt{n})

• Circle recognition in img

• Disjoint set implementation

• Detect cycle in linked list