Write a program to find common elements in **two sorted array**. In this program you have to find the intersection of two arrays.

Let’s say you have given two sorted arrays arr1[] and arr2[].

int arr1[]={2,3,4,5,6};

int arr2[]={4,6,7,8,9};

Technology Blog Where You Find Programming Tips and Tricks

How to reverse string in Javascript. This question is asked by Shashank on my WebRewrite Facebook page. Let’s check the solution of this problem .

The concept of Stack and Queue is very important in computer science. In previous post i already discussed stack and queue implementation. The purpose of this objective questions is to test how well you understand the concept of stack and queue.

Vi and Vim is very powerful editor in Linux operating system. I already discussed vi, vim commands in my previous tutorial.

In this article i’ll cover basic Linux commands with examples which is helpful for both beginners and experienced professionals.

Write a Program to find second largest element in an unsorted array. You can solve this problem by using sorting algorithm or you can do without sorting in single traversal O(n) time complexity.

Sorting algorithm such as Selection Sort, Insertion Sort, Bubble Sort is not suitable for large data elements as their **time complexity** is **O(n ^{2})** . For sorting you can use Merge Sort or Quick Sort.

Write an efficient program to generate Prime numbers between 1 to n. Or How to print prime number from 1 to n. It is one of the most asked interview questions.

In this post, I will discuss most efficient algorithm to generate Prime Numbers. Before this let’s understand what is prime number.