Archive for the ‘Uncategorized’ category

TechMyWay – New Blog

April 28, 2013

TechMyWay – New Blog

Much has happened since I graduated and started working. Here is a link to my new blog, which I try my best to keep updated. Follow me up there for future posts 🙂


Git add remote branch

September 27, 2012

A quick post on git (might help some):

To create a branch: git checkout -b branchName
#this also switches you to the newly created branch

Now to upload it to your remote repository use:
git push origin branchName
# if the branch with that name already doesn’t exist then it would be updated (as tested on GitHub)

A major milestone : 5k views

April 23, 2012

To all,

Thanks a lot for your love. My blog has crossed 5000 views. 🙂 🙂

K distance nodes in a Binary tree

February 3, 2012

For a Given node of a binary tree, print the K distance nodes.

For the solution, you can also refer to stackoverflow. This also tells that only one ancestor can be at K distance from a given node.

Source code: (written in C)

void K_dist_children(node * nd, int K)
// Base case
// The Kth child found
printf("%d\n", nd->val);

// K distance node from nd are at
// K-1 distance from children of current node
K_dist_children(nd->left, K-1);
K_dist_children(nd->right, K-1);

int K_dist_ancestor(node * cur,    //curent node
node * search, //node being searched
int K)
// If the node is found, return back the result
if (cur == search)
return K-1;

int n1, n2;

// recursively search for the node in the tree
n1 = K_dist_ancestor(cur->left, search, K);
n2 = K_dist_ancestor(cur->right, search, K);

// PS: n1 & n2 can't be non-(-1) at the same time

// if node found in any of the sub trees
if((n1 == -1) && (n2 == -1))
return -1;

// node found in right subtree
if((n1 == -1))
// the current node is at distance K
if(n2 == 0)
printf("%d", cur->val);

// return back the distance
return (n2-1);

// node found in left subtree
if((n2 == -1))
// the current node is at distance K
if(n1 == 0)
printf("%d", cur->val);

// return back the distance
return (n1-1);

void print_K_distance_nodes(node * root, node * search, int K)
// The structure of node is:
// struct node{
// int val;
// node * left;
// node * right;
// }

// Print the ancestor at distance K
K_dist_ancestor(root, search, K);

// Print the children at distance K
K_dist_children(search, K);

Hootsuite is amazing..

August 27, 2011

Hootsuite is amazing..

Count number of records

July 13, 2011

A very common people might face:

Count the number of records they have in their csv, and to make it interesting, check it from shell of your server..

Since you are accessing your server through an ssh connection via shell, running spreadsheet programs wouldn’t be of any help.. 😛

Now, a CSV is created by separating the data in a record by commas (,) and putting each record in a new line. Thus you can see the number of records by simply counting the number of lines in your file.

A simple bash command for that is:

wc -l filename.csv

Not much to write in that command..

Removing negative sign from excel column

June 29, 2011

I was recently writing an excel document for generating reports, but somehow the application converted one whole column of my data to negative values. I tried searching on internet and found one good method I wanted to share.

  • Write -1 somewhere and copy it (using Ctrl+C)
  • Select the column (or select the particular boxes) you want to make changes to.
  • Go to paste menu and select “paste special”.
  • Select “All” and “multiply” and press OK.
  • Done, that’s it. 🙂

The columns selected will be multiplied with -1 and the values will be stored there.

%d bloggers like this: