[SPOJ] ANARC09A - Seinfeld
Problem Statement ANARC09A - Seinfeld
Recent Posts
Balancing Brackets
Problem Definition You’re given a non-empty string made in its entirety from opening and closing braces. Your task is to find the minimum number of “operatio...
SPOJ ENIGMATH Solution
Problem Statement ENIGMATH - PLAY WITH MATH
Next Smallest Palindrome
Given a number, we have to find the next smallest palindrome which is larger than this number.
Bitwise Sieve w/ Code
Sieve of Eratosthenes is explained HERE Bitwise sieve is an optimized implementation of Sieve of Eratosthenes. It does the same thing but more memory effic...