Given a binary tree, find its minimum depth.

(more…)

# Linked List Cycle

Given a linked list, determine if it has a cycle in it.

(more…)

# Counting Inversions In An Array

Given array A[1… n], for every i < j, find all inversion pairs such that A[i] > A[j]

(more…)