FOURIER TRANSFORM
+========+
Time: 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a sequence of complex numbers, implement a function that performs a Fourier transform on the sequence using the Fast Fourier Transform algorithm
+========+
Please answer to this message with your solution ?

A SEARCH
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency matrix and a starting and goal vertex, implement a function that finds the shortest path from the starting vertex to the goal vertex using A search algorithm
+========+
Please answer to this message with your solution ?

BINARY SEARCH
+========+
Time: 30 minutes
Difficulty: Easy
Languages: Any
+========+
Given a sorted list of integers, implement a function that performs a binary search on the list and returns the index of the element if found or -1 if not found
+========+
Please answer to this message with your solution ?

K-MEANS CLUSTERING
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of points in two-dimensional space, implement a function that performs k-means clustering on the set, using the Lloyd's algorithm
+========+
Please answer to this message with your solution ?

HEAP SORT
+========+
Time: 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that performs a heap sort on the list
+========+
Please answer to this message with your solution ?

FIBONACCI SEQUENCE
+========+
Time: 30 minutes
Difficulty: Easy
Languages: Any
+========+
Given a number n, implement a function that returns the nth number in the Fibonacci sequence using recursion
+========+
Please answer to this message with your solution ?

TOWER OF HANOI
+========+
Time: 30 minutes
Difficulty: Easy
Languages: Any
+========+
Given a tower of n discs stacked in decreasing order of size and 3 pegs, implement a function that solves the tower of Hanoi puzzle by moving the discs from the first peg to the last peg with the help of the middle peg.
+========+
Please answer to this message with your solution ?

Dijkstra's Shortest Path
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a directed graph represented by an adjacency matrix and a source vertex, implement a function that finds the shortest path from the source vertex to all other vertices using Dijkstra's shortest path algorithm
+========+
Please answer to this message with your solution ?

QUICKSORT
+========+
Time: 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that performs a quicksort on the list
+========+
Please answer to this message with your solution ?