Your friend for GRE words and Vocabulary. Find here



About Debjyoti

This author has not yet filled in any details.
So far has created 76 blog entries.

JUnit and Mockito cooperation

By |November 27th, 2013|

Gmail keyboard shortcuts

By |November 26th, 2013|

“Vertica > PIG > Hadoop” on Counting Triangle problem

By |November 26th, 2013|

Playing with Hadoop Pig

By |November 25th, 2013|

SQL and pig!

Writing Hive Custom Aggregate Functions (UDAF): Part II

By |November 20th, 2013|

Writing Hive Custom Aggregate Functions (UDAF): Part I – Setting Eclipse

By |November 20th, 2013|

Technical: Hadoop – Sqoop on Cloudera (CDH) – Is Sqoop Set up and Configured for MS SQL Server

By |November 20th, 2013|

Using DiffMerge as git difftools for viewing the diff

By |November 7th, 2013|

Full form of computer related terms:

By |July 25th, 2013|

Max Concatenate

By |October 15th, 2012|

Given 2 strings, return the max number that can be formed by joining them.
For example, if the strings are:
45 and 456
2 numbers are possible
The output should be

int main(int argc, char * argv[]){
int a, b,min,i;
char *st;
 a= strlen(argv);
 b= strlen(argv);
 min= a < b ? a : b ;

     if (argv < argv){
             st=  strcat(argv,argv);

              return 0;



By |October 14th, 2012|

Bob has n heap(s) of gravel (initially there are exactly c piece(s) in each). He wants to do m operation(s) with that heaps, each maybe:

adding pieces of gravel onto the heaps from u to v, exactly k pieces for each,
or querying “how many pieces of gravel are there in the heap p now?”.

Help Bob do […]

Rectangles Counting

By |October 14th, 2012|

Given N separate integer points on the Cartesian plane satisfying: there is no any three of them sharing a same X-coordinate. Your task is to count the number of rectangles (whose edges parrallel to the axes) created from any four of given points.
There are several test cases (ten at most), each formed as follows:

The first […]

Number Game Revisited

By |October 14th, 2012|

Alice and Bob play the following game.They choose a number N to play with.The runs are as follows :

1.Bob plays first and the two players alternate.

2.In his/her turn ,a player can subtract from N any prime number(including 1) less than N.The number thus obtained is the new N.

3.The person who cannot make a move in […]

Graphs in Euclidean Space

By |October 14th, 2012|

The Chef is a bit tired of graphs. He has spent far too many days calculating shortest paths, finding bipartite matchings, minimum cuts, and optimizing over NP-hard problems. He needs a break. Unfortunately for him, the food services industry doesn’t take breaks. Once again, the Chef has to navigate through an undirected graph to keep […]

Generalized Independent Sets

By |October 14th, 2012|

Given a graph G on nodes V with undirected edges E, an independent set X is a subset of V such that no edge in E has both endpoints in X. Finding the size of the largest independent set in a graph is currently a very difficult problem.

Consider the following generalization of an independent set. […]