About Me

▼
Showing posts with label Yahoo Interview. Show all posts
Showing posts with label Yahoo Interview. Show all posts
Sunday, July 22, 2012

Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers

›
#define ARR_SIZE 100 #include<stdio.h> void printArray(int arr[], int arr_size) { int i; for (i = 0; i < arr_size; i++) p...
Thursday, November 17, 2011

Why 11/11/11 Is Mathematically Amazing

›
You All Know Some Times Back We Had Data 11/11/11, is a once-in-a-century occurrence, adding to a November has been a very fun month for ...
Saturday, August 6, 2011

Coin Denomination Problem

›
Let us say we have an amount we have to pay someone: say $97. The given currency has notes worth $1, $5, $10 and $50. Now, what is the minim...
2 comments:
Saturday, July 16, 2011

How to Count Number of Set Bits e.g. Number of 1's efficiently ?

›
This Question is asked in almost all core s/w companies & most of we know logarithmic solution of this problem but there exist a consta...
Monday, July 11, 2011

Given a word, convert it into a palindrome with minimum addition of letters to it. letters can be added anywhere in the word. for eg if yahoo is given result shud be yahoohay.

›
e.g ABBA : 0 (already a palindrome) ABB: 1 FAE: 2 FOO: 1 Simple Algorithm Will be You need to find the longest palindrome at the e...
6 comments:
Saturday, June 25, 2011

Write a program to merge two BST efficiently in O(n)

›
There are two methods to do this :- 1st 1)convert both tree into doubly linked list 2) merge both these doubly linked list 3) then crea...
Friday, June 24, 2011

Partition of Array Problem-NP Complete

›
the partition problem is an NP-complete problem. The problem is to decide whether a given multiset of integers can be partitioned into two ...
Thursday, June 2, 2011

WAP Check Endianess of Machine & Converting From One Endians To Other

›
First of all, Do you know what Little-Endian and Big-Endian mean? Little Endian means that the lower order byte of the number is stored in m...
Saturday, May 21, 2011

WAP to Find Maximum and minimum of an array using minimum number of comparisons

›
Write a C function to return minimum and maximum in an array. You program should make minimum number of comparisons. First of all, how do we...
Thursday, May 19, 2011

WAP to Calculate the next Smallest Prime Number From Given Number Efficiently

›
Given a number n, compute the smallest prime that is bigger than n. For example, n=8, then the smallest prime that bigger than 8 is 11. n=23...
2 comments:
Tuesday, May 3, 2011

WAP to Implement String reverse function using Bit Manipulation

›
#include /* Function to reverse str[] from start to end*/ void rverese(char str[], int start, int end) { char temp; while(start { ...
Monday, May 2, 2011

WAP to Calculate The Power x^n Efficiently in O(logn)

›
Method 1 Using Iterative Method #include main() { int num, p , result; printf("Enter the number : "); scan...
Saturday, April 30, 2011

How to find if a node/pointer corrupted in a linked list

›
How would you find out if one of the pointers in a linked list is corrupted or not? This is a really good interview question. The reason is ...
Sunday, April 24, 2011

WAP to Find Majority Element In Sorted Array Ofcourse It Shoud be Done in O(logn)

›
/* Program to check for majority element in a sorted array */ #include # define bool int /* If x is present in arr[low...high] then returns...

WAP to Find Two elements in Array whose sum is closest to zero

›
Algorithm 1) Sort all the elements of the array. 2) Find the index of first positive element, this is initial value of right index r. 3) Ini...
4 comments:

WAP to Find Median of Two Sorted Array in O(logn) Time

›
There are 2 sorted arrays A and B of size n each. Write an algorithm to find the median of the array obtained after merging the above 2 arra...
1 comment:

WAP to Find Median of Two Sorted Array in O(logn) Time

›
There are 2 sorted arrays A and B of size n each. Write an algorithm to find the median of the array obtained after merging the above 2 arra...
2 comments:
Saturday, April 23, 2011

WAP to print 2D array matrix in Spiral Order

›
Question: Given a 2D array / matrix of integers. Write a program to print the elements in spiral order. Consider a matrix as show in the di...
1 comment:
Friday, April 22, 2011

WAP to Write Find MaximumSize Sub-Matrix From Given Matrxi having Size of R*C

›
Maximum size square sub-matrix with all 1s April 4, 2010 Given a binary matrix, find out the maximum size square sub-matrix with all 1s. For...
Tuesday, April 12, 2011

WAP Create a singly linked list of Leaf nodes from a binary tree

›
include struct node { struct node *left, *right; int data; }; void LeafLinked(struct node *t, struct node **prevLeaf, struct nod...