GitHub

Evidence 4 of the course Implementation of Computational methods

For this evidence, we will take a 1400 complexity problem from Codeforces known as "C. Theofanis' Nightmare" The problem is about Theofanis who easily gets obsessed with problems before going to sleep ...
Nature

An efficient swarm evolution algorithm with probability learning for the black and white coloring problem

The Black and White Coloring (BWC) problem is initially described in 1. There is an undirected graph G = (V, E), where V is a set containing n vertices, and E is a set containing l edges. The vertices ...
LinkedIn

Beware Coding Practice Sites for Interview Prep

I recently reviewed interview preparation websites and realized that they’re now a decade more sophisticated than when I last interviewed. But I now have more than a decade of experience as a Google ...
GitHub

Maximum Subarray Sum

You are given an array (ARR) of length N, consisting of integers. You have to find the sum of the subarray (including empty subarray) having maximum sum among all subarrays. A subarray is a contiguous ...