Inspired by Google's Foobar challenge. It automates secretive candidate selection based on online activity, provides timed coding challenges, and allows hiring managers to evaluate submissions

This project contains a solution to the Travelling Salesman Person Problem and the 0/1 Knapsack Problem using a Genetic Algorithm with different customizations and setups.

Fundamental using Algorithm in python

Candidate selection using an iterative soft-thresholding algorithm

🍀 Own proposal of Selection Method Algorithm: Logarithmic Random Ponderated Selector; throw a random element of a list; but the closer the element is to the start is more probability to appear, based on logarithmic/exponential scale.

Selection algorithm with O(n log n) worst-case runtime