hi
I am looking for some web links where i can find problem solving questions and
method that one can use to solve the problems that are asked in
interviews.Please let me know if you came across one.
Thanks
Rag
--
You received this message because you are subscribed to the Google Groups
Hi
Question as in subject
*No extra space (can use one extra space)-O(1) max
*No order change allowed
example:
input : 1,-5,2,10,-100,-2
output: -5,-10,-100,1,2
input : -1,-5,10,11,15,-500,200,-10
output : -1,-5,-10,-500,-10,10,11,15
Thanks
Raghavn
--
You received this message because you
The main idea of this question is *not to change order of occurrence.Dutch
National flag other swapping like quick sort will change the order of
occurrence of number
try yourself with simple example for proof.
From: Ravi Ranjan ravi.cool2...@gmail.com
To:
of a previous post.Kindly refer to that post.
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Fri, Jun 29, 2012 at 10:41 AM, raghavan M peacelover1987...@yahoo.co.in
wrote:
Hi
Question as in subject
*No extra space (can use one extra space)-O(1) max
tire will always contain the link to all its children.This problem is just
printing out the children once the key is fully reached.
ie., search for abc in trie print all the children of c node.
Raghavan
From: deepikaanand swinyanand...@gmail.com
To:
Make all constructors private.
From: himanshu kansal himanshukansal...@gmail.com
To: Algorithm Geeks algogeeks@googlegroups.com
Sent: Friday, 22 June 2012 1:44 PM
Subject: [algogeeks] Adobe interview question
How will u implement an abstract class in c++ w/o
...
On 24 Mar 2012 14:23, raghavan M peacelover1987...@yahoo.co.in wrote:
For sake of in-place
Instead of doing it from the Start we can do it from the end in which
case, the data precision wont be lost.
Eg:
a1b2c3d4
start with d4
a1b2c3
now in next loop
a1b2ccc- here we have to do
For sake of in-place
Instead of doing it from the Start we can do it from the end in which case,
the data precision wont be lost.
Eg:
a1b2c3d4
start with d4
a1b2c3
now in next loop
a1b2ccc- here we have to do a)reallocation and b)copy the last 3
from next one it is more swaps :D
