thefourtheye.in

Celebrates the author's Python solution being featured in SPOJ's Top 20 for The Double Helix problem. A competitive programming milestone.

SPOJ ACODE - AlphaCode. Counts possible decodings of a numeric string where 1=A, 2=B, ..., 26=Z using dynamic programming. Handles single and double digit interpretations.

A classic SPOJ problem requiring string manipulation to find the smallest palindrome greater than a given number with up to 1 million digits. Explains the algorithm approach using string reflection and handling edge cases like all-9s numbers.

SPOJ problem ONP - Transform algebraic expressions with brackets into Reverse Polish Notation (RPN). Uses a stack-based algorithm to convert infix expressions to postfix for easier evaluation.

Covers multiple algorithms for testing primality - from basic O(n) trial division to optimized approaches checking only up to square root, and skipping even numbers after 2.