Career notes

Cycle Detection Tags: Moderate, graphsProblem descriptionYou have a directed connected graph. (for bonus points, drop the "connected" assumption) Write an algorithm that detects a cycle, if any exists, and returns ...
Posted Feb 15, 2011 4:11 PM by Amin Ariana
Maximum contiguous sub-matrix Tags: Moderate, dynamic programmingProblem descriptionGiven an N-dimensional matrix of n elements of signed integer type, find the contiguous sub-matrix with the maximum sum.Simplified version: Given ...
Posted Feb 4, 2011 5:53 PM by Amin Ariana
Least common ancestor Tags: Moderate, data structure transformationProblem descriptionYou have a tree data structure. The ancestors of a given node are defined to be the node itself, its direct parent, or ...
Posted Nov 30, 2011 3:30 PM by Amin Ariana
Levenshtein edit distance Tags: Difficult, dynamic programmingProblem description(From Wikipedia) In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i ...
Posted Feb 4, 2011 5:21 PM by Amin Ariana