Software Developer/ Programmer interview questions – page 6

Support n stacks using an array

Reversing linked list recursively returning the head without any global variables at all

Write ftoa() procedure. i/p: float no. o/p: string representation.

A graph is given with "n" nodes, having the property symmetric and transitive. Write a code to proof all the nodes of the graph can communicate with each other.

You have to read a text file and maintain count of the occurrences of words in the text. for e.g. how are you doing? Are you ok? we have are and you coming twice and all others are occurring just once . So all you have to do i...

2. Number of times multiplication is required:

How to remove the duplicates in a sorted array and return the number of unique elements in linear time and constant space.

Given a 2D array which has all columns sorted and all rows sorted. Find the kth largest element in such array.

Assume that index i is within the stack size. Stack is implemented using an array A[1, ... N] and index variable is i push and pop operations are defined as below push: start A=x, i=i+1 pop: start i=i-1, x=A to implement stack co...

A sorted array is rotated any number of times now write a code to search a number in this array (without disrupting the original elements in the array)

In a 2D-Matrix, there is one row which is equal to a particular column. Find that particular row and Column in the most efficient way possible. eg. 1 2 4 6 4 7 7 8 3 9 7 2 1 4 8 5

What kind a data structure will you use to implement an Instant Search feature.

In a boolean array, find the maximum size submatrix with all 1s (Note that its not the maximum square submatrix).

Find the element from unsorted array whose sum is equal to given number S.

U have an array of nos write an algo that will place multiplication of other nos at each position (I told them first multiply all elements. Let multiplication be M. Then for each element divide that element by M) He told me to do the s...

4. Specification of variables in one language: letter follow by letter or digit. options: 1. (LUD)* 2. L.(LUD)* => this one right. 3. L.(L.D)+ 4. L.(L.D)*

You have a file containing lines of text and then each line has words.

Find the longest repeated substring given an input string. eg. given "banana" you should find "anana"

Clone a connected undirected graph. Input is a node*. Return the node* of the cloned graph.

Given one n size array which is filled with only two no. You have to find out which no. occurs more. Do it using minimum number of comparisons.

Efficiently find the number of reptitions of a given number x in a sorted array arr[].

In a stream of numebers, how will you find out n smallest numbers at any moment? how will u store them

Write a function void DrawRectangle(char *Screen, int x1, int y1, int x2, int y2). Height and width of the monitor is known. To set a pixel, you need to set that particular bit of the screen.

Given an integer array. { 1,2,3,4,5 } Compute array containing elements 120,60,40,30,24 (2*3*4*5,1*3*4*5, 1*2*4*5, 1*2*3*5, 1*2*3*4)

You're given a string, and you want to split it into as few strings as possible such that each string is a palindrome. (I guess a one char string is considered a palindrome, i.e. "abc" is split into "a", "b", "c".)

Explain an algorithm for sorting a set of Strings..The constraint here is that all the strings doesn't fit in memory at a time..Please do mention the complexities of ur Algorithm

Spiral printing of a matrix

There is a binary tree. You will need to find out if at any node it behaves as binary search tree if broken at that node in O(N) time complexity

You are given a list of strings. Find a way to combine and store them in such a way that it you can retrieve the original strings.

Find out the no. of vertices in a graph given the graph is: a) Undirected cyclic b) Directed Cyclic c) Undirected non cyclic d) Undirected non cyclic.