PERL SCRIPT for killing CLOSE_WAIT

Some time our application gets chocked because of large number of connection in COSE WAIT state, In such case there is only way to get rid of it by closing application, but in production we cann't kill our application this frequently, so here is a hack I come accross for it.

Ultimate solution :: optimise and find reason in your application.

#!/bin/bash
netstat -tulnap | grep CLOSE_WAIT | awk '{print $4,$5}' |  sed 's/:/ /g' | awk '{print $2, $3, $5, $6}'|  while read line; do
        echo $line
        perl kill_cw.pl $line;
done


wget http://apt.sw.be/redhat/el6/en/x86_64/rpmforge/RPMS/perl-Net-RawIP-0.25-1.el6.rf.x86_64.rpm
wget http://apt.sw.be/redhat/el6/en/x86_64/rpmforge/RPMS/perl-Net-Pcap-0.16-1.el6.rf.x86_64.rpm
wget http://www6.atomicorp.com/channels/atomic/centos/6/i386/RPMS/perl-NetPacket-0.41.1-1.el6.art.noarch.rpm

rpm -Uvh  perl-Net-RawIP-0.25-1.el6.rf.x86_64.rpm
rpm -Uvh perl-Net-Pcap-0.16-1.el6.rf.x86_64.rpm
yum install perl-Net-Pcap

rpm -Uvh  perl-NetPacket-0.41.1-1.el6.art.noarch.rpm

(http://pkgs.org/centos-6/atomic-i386/perl-NetPacket-0.41.1-1.el6.art.noarch.rpm.html)

Install PhantomJS on Ubuntu

cd /usr/local/share

sudo wget http://phantomjs.googlecode.com/files/phantomjs-1.9.2-linux-x86_64.tar.bz2

sudo tar xjf phantomjs-1.9.2-linux-x86_64.tar.bz2

sudo ln -s /usr/local/share/phantomjs-1.9.2-linux-x86_64/bin/phantomjs /usr/local/share/phantomjs

sudo ln -s /usr/local/share/phantomjs-1.9.2-linux-x86_64/bin/phantomjs /usr/local/bin/phantomjs

sudo ln -s /usr/local/share/phantomjs-1.9.2-linux-x86_64/bin/phantomjs /usr/bin/phantomjs

on this,

phantomjs -v

it will give
1.9.2

Some learning on Cassandra - I

In this post we will not talk about  Cassandra – Data Model, There are many blogs on them and one of the best describe is by Animesh Kumar, oh yup Animesh sir is my collage(ISM) senior.

How should we store Object* into Cassandra database ?

*object: like a list<String>, instances of a class, etc

poor approach:

Serialize the Object into JSON.
Now store this JSON as a string into Cassandra.
When need to get the object, read JSON string, deserialize the JSON.

The above approach is fine and works well, but It have its own disadvantage. Say we have
Object(as JSON):
{
  name: "nijju"
  country: "IN"
  email: "niraj.nijju@gmail.com"
}

and we store it into a column into cassandra( as string).
When we need to update a field say country then we need to read the whole JSON string, then we need to deserialize it, and then to change the object attribute and again serialize the resulting object into JSON and storing this JSON at that key.

As in cassandra write is much faster than read operation, so making a read before write will not be a good approach.
Even if your application is mostly write-once data then for reading a single field will make to read all.

In conclusion, we can better performance by storing all the fields into a separate column. For making an update on a field we only need to re-write the corresponding column.

Among the given two ways, what is the better method to store into cassandra ?



Storing 1 millions of rows with 10 column each.




Storing 100 of row with 100K columns each.

It totally depends on our read behavior, as rows will be store on random disk, so reading from various rows at same time will be slow.
and If rows will be too long then these columns will be stored together on same node so we may have scalability challenges.

                                                       Let me know your thoughts

Python script for get the files_from_directory, using_grep_on_file, on_day_increment

How can I find all files in directory with the extension .txt in python?

http://stackoverflow.com/questions/3964681/find-all-files-in-directory-with-extension-txt-with-python

import glob
import os
#os.chdir("/mydir")
for files in glob.glob("*.txt"):
    print files

python grep on file

for line in open("file_name"):
 if "search_string" in line:
   print line

Python increment day in datetime:

import datetime
today = datetime.datetime.today()
today += datetime.timedelta(days=1)

Google Code Jam Problem C. Fair and Square

Below is my solution for Problem C. Fair and Square

Well I qualified for Google Code Jam 2013 with only 60 points.

* Still to add method to handle Large Input 2.

Problem

Little John likes palindromes, and thinks them to be fair (which is a fancy word for nice). Apalindrome is just an integer that reads the same backwards and forwards - so 6, 11 and 121 are all palindromes, while 10, 12, 223 and 2244 are not (even though 010=10, we don't consider leading zeroes when determining whether a number is a palindrome).

He recently became interested in squares as well, and formed the definition of a fair and square number - it is a number that is a palindrome and the square of a palindrome at the same time. For instance, 1, 9 and 121 are fair and square (being palindromes and squares, respectively, of 1, 3 and 11), while 16, 22 and 676 are not fair and square: 16 is not a palindrome, 22 is not a square, and while 676 is a palindrome and a square number, it is the square of 26, which is not a palindrome.

Now he wants to search for bigger fair and square numbers. Your task is, given an interval Little John is searching through, to tell him how many fair and square numbers are there in the interval, so he knows when he has found them all.

Solving this problem

Usually, Google Code Jam problems have 1 Small input and 1 Large input. This problem has 1 Small input and 2 Large inputs. Once you have solved the Small input, you will be able to download any of the two Large inputs. As usual, you will be able to retry the Small input (with a time penalty), while you will get only one chance at each of the Large inputs.

Input

The first line of the input gives the number of test cases, T. T lines follow. Each line contains two integers, A and B - the endpoints of the interval Little John is looking at.

Output

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the number of fair and square numbers greater than or equal toA and smaller than or equal to B.

Limits

Small dataset

1 ≤ T ≤ 100.

1 ≤ A ≤ B ≤ 1000.

First large dataset

1 ≤ T ≤ 10000.

1 ≤ A ≤ B ≤ 10¹⁴.

Second large dataset

1 ≤ T ≤ 1000.

1 ≤ A ≤ B ≤ 10¹⁰⁰.

Sample

Input	Output
3 1 4 10 120 100 1000	Case #1: 2 Case #2: 0 Case #3: 2

Input is taken from a file(C-small-practice.in)

Method 1:

/*

* @author niraj.nijju

*/

package gcj.TwelveThirteen;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;

public class SmallOfFairAndSquare {

public static void main(String [] args){
try{
// System.out.println(Double.MAX_VALUE);
// System.exit(0);

  FileInputStream fstream = new FileInputStream("C-small-practice.in");
  DataInputStream in = new DataInputStream(fstream);
  BufferedReader br = new BufferedReader(new InputStreamReader(in));
  String strLine;
  strLine = br.readLine();
  int T = Integer.valueOf(strLine);
  System.out.println("T: "+T);
  int i=1;
  while ((strLine = br.readLine()) != null)   {
//   System.out.println (strLine);
  String [] str = strLine.split(" ");
  double x = Double.valueOf(str[0].trim() );
  double y = Double.valueOf(str[1].trim() );
  int count= getFairSqur(x,y);
  System.out.println ("Case #"+i++ +": "+count);
  }
  in.close();
}catch (Exception e){//Catch exception if any
  System.err.println("Error: " + e.getMessage());
  e.printStackTrace();
}
}


public static int getFairSqur(double x, double y){
int count=0;
long x1 = (long)Math.ceil(Math.sqrt(x));
long y1 = (long)Math.sqrt(y);

for(long i=x1; i<=y1; i++ ){
if(checkPalindrom(i)){
long sq=i*i;
if(checkPalindrom(sq)){
// System.out.println("("+i+")");
count++;
}
}
}


return count;
}



    public static Boolean checkPalindrom(long n)
    {
     String normal = String.valueOf(n);
    //reverse the letters in string
    int length = normal.length(); //length of string
    StringBuffer result = new StringBuffer(length);
    int i;
    for(i = length - 1; i>=0; i--)
    {
    result.append(normal.charAt(i));
    }
    long r = Long.valueOf(result.toString());

    if(r==n)
     return true;
    return false;
    }


}

Method 2:

/*

* @author niraj.nijju

*/

package gcj.TwelveThirteen;

import java.io.BufferedReader;

import java.io.DataInputStream;

import java.io.FileInputStream;

import java.io.InputStreamReader;

import org.omg.CORBA.INTERNAL;

public class CopyOfFairAndSquare {

public static long [] array = new long[10000010];

public static void main(String [] args){

fillArray();

try{

// System.out.println(Double.MAX_VALUE);

// System.exit(0);

  FileInputStream fstream = new FileInputStream("C-small-practice.in");

  DataInputStream in = new DataInputStream(fstream);

  BufferedReader br = new BufferedReader(new InputStreamReader(in));

  String strLine;

  strLine = br.readLine();

  int T = Integer.valueOf(strLine);

//   System.out.println("T: "+T);

  int i=1;

  while ((strLine = br.readLine()) != null)   {

//   System.out.println (strLine);

  String [] str = strLine.split(" ");

  double x = Double.valueOf(str[0].trim() );

  double y = Double.valueOf(str[1].trim() );

  //int count= getFairSqur(x,y);

  long count=0;

  int xr = (int)Math.sqrt(x);

  int yr = (int)Math.sqrt(y);

  count = array[yr]-array[xr];

  if(xr*xr == (int)x){

  if(checkPalindrom(xr) &&  checkPalindrom(xr*xr)){

  count++;

  }

  }

  

  

  System.out.println ("Case #"+i++ +": "+count);

  }

  in.close();

}catch (Exception e){//Catch exception if any

  System.err.println("Error: " + e.getMessage());

  e.printStackTrace();

}

}

public static void fillArray(){

long count = 0;

for(int i=1;i<array.length;i++){

long j = (long)i;

if(!checkPalindrom(j))

array[i]= count;

else if(!checkPalindrom(j*j))

array[i]= count;

else{

count++;

array[i]= count;

}

}

}

    public static Boolean checkPalindrom(long n)

    {

     String normal = String.valueOf(n);

    //reverse the letters in string

    int length = normal.length(); //length of string

    StringBuffer result = new StringBuffer(length);

    int i;

    for(i = length - 1; i>=0; i--)

    {

    result.append(normal.charAt(i));

    }

    long r=0;

    try{

     r= Long.valueOf(result.toString());

    }catch(Exception e){

     e.printStackTrace();

     System.out.println("i:"+i+"\tr:"+r+"\tn:"+n);

    }

    if(r==n)

     return true;

    return false;

    }

    

    

}

Google Code Jam Problem B. Lawnmower

Below is my solution for Problem B: Lawnmower

Well I qualified for Google Code Jam 2013 with only 60 points.

Problem




Problem

Alice and Bob have a lawn in front of their house, shaped like an N metre by M metre rectangle. Each year, they try to cut the lawn in some interesting pattern. They used to do their cutting with shears, which was very time-consuming; but now they have a new automatic lawnmower with multiple settings, and they want to try it out.
The new lawnmower has a height setting - you can set it to any height h between 1 and 100 millimetres, and it will cut all the grass higher than h it encounters to height h. You run it by entering the lawn at any part of the edge of the lawn; then the lawnmower goes in a straight line, perpendicular to the edge of the lawn it entered, cutting grass in a swath 1m wide, until it exits the lawn on the other side. The lawnmower's height can be set only when it is not on the lawn.
Alice and Bob have a number of various patterns of grass that they could have on their lawn. For each of those, they want to know whether it's possible to cut the grass into this pattern with their new lawnmower. Each pattern is described by specifying the height of the grass on each 1m x 1m square of the lawn.
The grass is initially 100mm high on the whole lawn.


Input

The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins with a line containing two integers: N and M. Next follow N lines, with the ith line containing M integers a_i,j each, the number a_i,j describing the desired height of the grass in the jth square of the ith row.


Output

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is either the word "YES" if it's possible to get the x-th pattern using the lawnmower, or "NO", if it's impossible (quotes for clarity only).


Limits

1 ≤ T ≤ 100.


Small dataset

1 ≤ N, M ≤ 10.
1 ≤ a_i,j ≤ 2.


Large dataset

1 ≤ N, M ≤ 100.
1 ≤ a_i,j ≤ 100.


Sample

Input	Output
3 3 3 2 1 2 1 1 1 2 1 2 5 5 2 2 2 2 2 2 1 1 1 2 2 1 2 1 2 2 1 1 1 2 2 2 2 2 2 1 3 1 2 1	Case #1: YES Case #2: NO Case #3: YES