GeeksforGeeks

How to find the largest palindrome in the string??

Any body, give a program / logic to traverse a tree in helical order

ex:
tree:
...

Please explain the associativity and order of execution in this statement
b= a + ++b + (a-b);
() has the highest precedence. but a-b is...

You are given a function printKDistanceNodes which takes in a root node of a binary tree, a start node and an integer K. Complete the function to p...

How to find all the permutations of a string such that two equal permutations appear only once.
That is all permutations should be unique

struct node {
   int data;
   struct node* left;
   struct node* right;
};
typedef struct node* Node;  

//root: Current tree node
//prev: this p...

implementing stacks and queues using inheritance from linked list???

What will be the time complexity T(n) and space complexity S(n) of the following Algorithm?
How can we build a recursion tree for the same?

Given a linked list as follows:
a->b->c->1->2->3
Arrange it in a manner it would return
a->1->b->2->c-...

This statement swaps the values in a and b :
b=a+b-(a=b);
can anyone plz explain the steps involved in the execution of this statement....

Input (num = 3)
1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10

Output
3 -> 2 -> 1 -> 6 -&g...

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].

You are racing on a 2D lattice grid starting from the origin (0,0) towards a goal (M,N) where M and N are positive integers such that 0 < M <...

Q. write an algorithm to sort the n element of an array having element 1 to n , without using extra static variable ,global variable ,any extra spa...

#include<stdio.h>

int main()
{
  int i, j;
  int arr[4][4] = { {1, 2, 3, 4},
                    {5, 6, 7, 8},
                    {9, 10...

The elements of an array are 1s and 0s. Change all the elements of this array as 1.
Use only a single statement and do not use any operator o...

Given a single linked list with an additional pointer to a random node (which can also be NULL), clone the list and return it.

Example: