Memory is not a constraint. In a single iteration(NOTE: you can't go back), how will you find out the 10th last node/item in a linked list.

Input an array and then print the repeating characters?? Example: Input:1,3,23,11,44,3,23,2,3. Output:3,23 plz help me.... i want a code of it. In C language.

ques-Input an array and prints the second minimum in an array?? Example Input:34,45,21,12,54,67,15 Output:15 I want a solution in C/C++ language

Find the longest palendrom in a string? Example Input: abfgerccdedccfgfer Output: ccdedcc i want a solution in C/C++ language

Ques--Input a number and then find the next higher number such that for both the number (inputted and the next higher number) in binary representation contains equal number os ones. Example: Input:3(0000000000000011) Ouput:5(0000000000000101) I want a solution in C/C++ language

A table containing decimal nos. from 1 to 100 and their roman Equivalent was given. We were required to write a function : char* ConverToRoman(int number) : to convert the given number( 1<=number<=100) into its numerical equivalent. I want a solution in C/C++ language

An array was given and we were required to write a function : int CalculateThirdHighest(int a[ ]) : which calculates the third highest number in the array. While coding in C remember to calculate the length of array using formulae length of array=sizeof(a)/sizeof(int). Because the number of elements of array were not passed as argument. i want a solution in C/C++ language

Two sentences are given and we were required to print the common word in the two sentences. Words were delimited by space, full stop, ? , ! and , . The trick in the question was that common word should be printed only once so if ur first sentence contains two word "how" and second contains "how" then in output how should be printed only once for this u can replace each matched word in second sentence by spaces . i want a solution in C/C++ language

We were required to write a program to check whether the given number was of the form 3^n. ( i.e. 3 to the power n). I knew that it can be done by bit manipulation but couldn't make out the logic. i want a solution in C/C++ language

There are two sorted arrays a1 and a2 of size n1 and size n2 respectively. array a1 is full array a2 has exactly n1(size of array a1) empty space. example a1[]=1234 a2[]=56789_ _ _ _ Write a function to merge these two arrays to form a sorted array without any extra memory use. i want a solution in c/c++ language

There is a lucky draw held every day. If there is a winning number eg. 1876, then all possible numbers like 1867 ,1687,1768 etc are the numbers that match irrespective of the position of the digits. Thus all these numbers qualify fr the lucky draw prize. Assume there is no zero digit in any numbers. Write a program to show all the possible winning numbers if a "winningnumber" is passed as an argument to the function. i want a solution in c/c++ language

there is a matrix N x N .Its elements consist of either value =1 or value=0. If there is a any zero in the row, then the output matrix should have all zeroes in that row. If there is a single zero in any column then that column should have all zeroes n the output matrix. write the function to perform these operations. i want a solution in c/c++ language