#### MOST POPULAR

### Kill A Process Running On A Particular Port In Windows

This has become a very common scenario for me these days. I have my grails application running on localhost:8080 and at times I need...

#### PROBLEMS

### Project Euler : Evaluate Sum Of All Amicable Pairs

Once the task of finding sum of all divisors was taken care of, this problem held little challenge. I have mentioned how to compute...

### Project Euler : The Millionth Lexicographic Permutation Of The Digits

The 24th problem of Project Euler wanted the one-millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and...

#### LATEST ARTICLES

Chelsea's biggest move in the Transfer Market '2015 has been getting Radamel Falcao on loan. I don't know if I should be happy about this move or not. We have seen a lot of strikers come and fail at...

Outside Java code I prefer snake_case over camelCase. This is mostly a preference without any strong good reason:
Without a proper IDE I find it easier to read snake_case words than camelCase words.
Python's naming convention uses snake_case for variable names....

The disappearance of the British Raj in India is at present, and must for a long time be, simply inconceivable. That it should be replaced by a native Government or Governments is the wildest of wild dreams ... As...

The best way to solve Tower of Hanoi problems is to think of a recursive solution. You assume you know how to move n-1 discs from one peg to another and use recursion to solve for n discs. This one is no different. Simple and easy.

A simple straight-forward Knapsack solution.

A very productive Sunday after a long time! Loved working on this problem and learnt something new in the process. :) I think this might turn out to be much more fun than Project Euler.

Problem:
You are given an equation of the type "a + b = c". One of the numbers is replaced by the word "machula". Figure out the missing number and fix the equation.
Solution:
With Python this problem was super easy to...

Problem:
Given an array of N numbers in non-decreasing numbers, the problem is to find the summation of all distinct pairs in the given array.
Clarification:
The term "distinct pairs" need a little clarification as it is not explained very well in...

It was the year 2009. Prasun told us about a book he had recently read - Phantoms in the Brain by Dr. Ramachandran. The topic interested me and I read the book too. And I was surprised, actually scared,...

Finally found a framework for writing crawlers in Python - Scrapy. And it's surprisingly easy to use. I was able to extract player ratings of football games from WhoScored.com website. It took me just ~10 minutes to process games in 11 tournaments in 6 months time period.