iterative and recursive breadth first traversal of binary tree @author FLAG @param <T> Generic type

The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given denominati

Divide two integers using only subtraction, addition and bit operation @author FLAG

Implements greatest common divisor (GCD) using Euclidean's method that supports negative inputs @author FLAG

An implementation of the KMP searching algorithm based on the understanding of this lecture: https://www.youtube.com/watch?v=GTJr8OvyEVQ @author FLAG

Computes the length of the longest increasing path in a 2D matrix of integers. Valid directions include: left, right, up or down. @author FLAG

A backtracking method to solve N-Queen puzzle. The N-Queen puzzle is the problem of placing chess queens on a square chess board so that no two queen

All about prime numbers @author FLAG

implements (int)Math.sqrt(x) with two different methods @author FLAG