Backtracking - M Coloring Problem


Backtracking is an algorithmic paradigm that tries different solutions until finds a solution that “works”. Problems which are typically solved using backtracking technique have following property in common. These problems can only be solved by trying every possible configuration and each configuration is tried only once.

Given an undirected graph …

more ...


scikit-learn: Random Forest

A random forest is a meta estimator that fits a number of decision tree classifiers on various sub-samples of the dataset and use averaging to improve the predictive accuracy and control over-fitting ...

more ...




Nim Games


Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects provided they all come from the same heap.
Nim can be played as a …

more ...


Confusion Matrix


A confusion matrix, also known as a contingency table or an error matrix or tavle of confusion, is a specific table layout that allows visualization of the performance of an algorithm, typically a supervised learning one (in unsupervised learning it is usually called a matching matrix).

It is a table …

more ...


Squad Teams


A squad is a cross-functionnal self-organizing team (less than 8 people). It is a small business cluster running like a startup in its own right.
The team has end-to-end responsability for the stuff they build (design, deployment, operation). Ideally, each squad is fully autonomous. There should be no blocking dependencies …

more ...


Backtracking - Rat in a Maze


A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach destination. The rat can …

more ...