GeeksforGeeks

Let '[b]S[/b]' be a set denoting a set of '[b]n[/b]' intervals {i(1),i(2),...,i(n-1),i(n)}. Given starting time and ending time of each interval {(...

Find the two nodes in Binary Tree which have longest distance between them.
i know its somewhere analogous to finding the diameter but then t...

void shellsort(int a[],int array_size) {
int i,j,incr,temp;
incr=3;
while(incr>0)
{
    for(i=0;i<array_size;i++) {
           j=i;
       ...

[b]Write A program to find the longest Increasing Sub-sequence in an Array. In sub-sequence, elements may not be contiguous, but these should be in...

Suppose that in addition to being sorted, the entries of A are distinct integers. Design an efficient algorithm for finding an index i such that A[...

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a sing...

Given a string tell whether its a valid passwd or not.
Other rules are simple but the third one is tricky:
* the string should not have...

given an array of integers, we need to find all strictly increasing subsequences in this array.
A subsequence can start at any element and en...

I want to use Divide and Conquer algorithm for finidng Majority Candidate from an Array.
Can any let me know how todo that ? Or Can any one g...

convert a binary tree to binary search tree inplace. We cant use any extra space.

What is @override annotation in java? what it will do?

In given array of elements like [a1,a2,a3,..an,b1,b2,b3,..bn,c1,c2,c3,...cn] Write a program to merge them like [a1,b1,c1,a2,b2,c2,...an,bn,cn].

also known as cryptarithmetic is a type of puzzle where you have to assign digits to alphabets such that no two alphabets get the same digits.only ...

given 3 strings X, Y and Z. Find all solutions to a numeric puzzle: X + Y = Z where
each character in a string corresponds to some digit (not...

Determine the first common ancestor of twi given leaf nodes in Binary Tree.

How to find the median of an array of integers using Heaps

int a=4,b=5;
int x=++a*++a*++a;
int y=++a*++b*++b;
printf("%d,%d",x,y);

Please explain each step??