About Me

▼
Showing posts with label Hyves Interview. Show all posts
Showing posts with label Hyves Interview. Show all posts
Tuesday, November 29, 2011

Find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum.

›
Friday, September 16, 2011

Given a list of N line segments on the X axis: (x1[i], x2[i]) where i = 1 to N; And then a list of M queries. Each query inputs one x-coordinate and you need to output the set of all {i} that overlaps this point.

›
Wednesday, August 24, 2011

Design an algorithm that takes strings S and r and returns if r matches s. (Assume r is a well-formed regular expression.)

›
Before starting solving we need to think about some test cases  like .,*,?,^,$  e.g about a regular expression grammar. A regular expr...
Tuesday, August 23, 2011

Write a function int interval_unfold_count(int n); that returns the length of the shortest sequence of operations resulting in either L or R being equal to N.

›
Two integer variables L and R are initially equal to 0 and 1 respectively (i.e. L = 0 and R = 1). The values of these variables can be mani...
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...
Tuesday, May 3, 2011

WAP to Find Occurance of a Number N in Sorted Array in O(logn)

›
Given a sorted array and a number n.How can u find the number of occurance of n in the array . should be o(logn) Modified Binary Search...
Monday, May 2, 2011

WAP to Find Square root of Perfect Square Number Efficiently Yes in O(logn)

›
As its a perfect square!! So arrange numbers from 1 to n/2 and do a binary search.. ie for i from 1 to n/2 Now compare mind*mid to n ...

Write a function that computes log2() using sqrt().

›
Well Its Very Interesting &n Tough Question Unless You Think ..Most of Us Stuck Whats The Use of Sqrt(0 to calculate log2() ..isn't ...
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 ...
Friday, April 29, 2011

WAP to Check if if two strings are anagrams or not. in O(n) ..?

›
There are 4 ways to solve this problem: as i can solve it each has complexity Issue Solution #1: Sort the strings boolean anagram(String s,...
3 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...
Wednesday, April 6, 2011

WAP to Generate Unique Combination from Given Set ot String

›
What is combination and how is it different from a permutation? The mathematics' gurus would know this by heart, but I am going to refer...
1 comment:
Sunday, April 3, 2011

Dominator of an array ...Majority Element In Different Way

›
Majority Element Different Possible Solutions Solution 1: A basic solution is to scan entire array for checking for every element in the a...
1 comment:

Amplitude of Element In Unsorted Array

›
/* The amplitude of a non-empty zero-indexed array A consisting of N numbers is defined as amplitude(A) = max { A[P] - A[Q] : 0 Writ...
1 comment:
Sunday, March 6, 2011

WAPFind nth Fibonacci number Efficiently..its in O(logn)

›
The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 141, …….. In mathematical ...
2 comments:
Thursday, February 24, 2011

WAP to Convert Zig Zag level order Traversal of Tree to Doubly Linked List

›
Method 1 using 2-Stack--Need Modification RunTime Error But Logic is 100% Correct #include #include /* Structure for Tree */ struct node { ...
Tuesday, February 22, 2011

WAP for Quick Sort Algorithm

›
Data Structure used:Array Algorithm:Divide & Conquer 1. Phase:Partition O(N) Time 2. Phase: Divide the array in two part Recursivel...
1 comment: