Anyone has any hint ?
On Mon, Aug 6, 2012 at 11:32 PM, Subhransu wrote:
> As this might be discussed many times in this thread but cant able to
> trace back the archived emails, so reiterating
>
> If i have to design a elevator system(for simplicity let's say 6 elevator),
&g
As this might be discussed many times in this thread but cant able to trace
back the archived emails, so reiterating
If i have to design a elevator system(for simplicity let's say 6 elevator),
1. How will be my *classes* look like ?
2. Which all *DesignPattern* i should use and how effective i can
Is there any solution which will take care deleting a node Given only a
pointer to a node to be deleted in a singly linked list(
*How Do we consider deleting the last node*) *
*
*Subhransu
*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks&q
Exam - The How ...
on Your First Try Certification Study Guide by William Manning
Appreciate the help
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks"
Here you go in C code
http://codepad.org/gk6AZj0T
int main()
{
if(printf("hello")!=0) {
printf("world");
}
else {
printf("SCREWED ! ! !"); }
return 0;
}
*
*
*
*
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
scenario ?
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Sat, May 28, 2011 at 10:47 AM, Aakash Johari wrote:
> @Dave: I have suggested another solution in previous threads. Please go
> through that. That is without maps. It uses array for m
Could you please mail me the URL/PDF of this. the above link seems not
working for me
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Wed, Apr 20, 2011 at 7:22 AM, D.N.Vishwakarma@IITR wrote:
> *I've already got But thanks for your link
&g
@Dave:
It can have multiple values(twice, thrice,. . . ).
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Sun, Apr 17, 2011 at 1:06 AM, Dave wrote:
> @Subhransu: Your description and new example still leave open the
> question of w
?
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Sat, Apr 16, 2011 at 11:57 PM, Subhransu
wrote:
> Rephrasing the array to reflect one non-repetative element. Inconvenience
> regretted.
> A{1, 1024, 2 , 1, 2, *3*, 4, 4, 1024}.
> Now th
Rephrasing the array to reflect one non-repetative element. Inconvenience
regretted.
A{1, 1024, 2 , 1, 2, *3*, 4, 4, 1024}.
Now there only one non-repetative element "3"...
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Sat, Apr 16, 201
C'mon guys .....
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Fri, Apr 15, 2011 at 5:49 PM, Subhransu wrote:
> Hey Geeks,
>
> Though there are multiple algo to find an element but with a complexity of
> O(N),
> How to find NO
complexity n.
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe f
@baghel: The method returns the desire output.
But looking for some algo which can do the same.
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Tue, Apr 12, 2011 at 12:08 AM, baghel wrote:
> This solution is incorrect.you are only consider
I didnt get the step 3. Could you please elaborate this(dry run be good to
understand and bringing it for generic solution).
Also how best the complexity will be .
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Mon, Apr 11, 2011 at 12:27 AM, ArPiT
What could be the efficient algo for finding permutation of string.
Lets say a user enter a string "abc".
The output should be 6(3*2*1) along with he combination of them like
abc
bca
cab
bac
acb
cba
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhra
The worst case for any sort is *"nlogn"* . have 2 see some other approach
than sorting [?]
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Fri, Apr 1, 2011 at 6:02 PM, snehal jain wrote:
> For a set S of n real numbers, a pair of
Don't you think sorting the array and take the first & last element ! ! !
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Wed, Mar 30, 2011 at 12:43 PM, UTKARSH SRIVASTAV wrote:
> Problem
> Can anyone give me the efficient algo
propose one approach you guys also can think a better one.
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Wed, Mar 30, 2011 at 12:55 PM, Saikat Debnath wrote:
> @ Subhranshu : Your approach will fail for a case let X = {-1,4,2,3} and
> your su
e list and found closest match
will be 3. Then recursively search for 3 now where closest match is 2)
Any algo with better complexity will be appreciated.
*Subhransu Panigrahi
*
*Email:* subhransu.panigr...@gmail.com
--
You received this message because you are subscribed to the Google Groups
"
heaver then you have 3 balls (4, 5 , 6)
Compare 4 to 5
if both equals then heaver is 6th one or out of 4 & 5 one is heaver
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
> On Mar 25, 2:46 am, Lavesh Rawat wrote:
> > *Weighi
byte + padding 3 byte + b[4 byte] + c[2 byte] + 2 byte padding = 12byte
) instead of 7 byte.
*Subhransu Panigrahi
* *Email:* subhransu.panigr...@gmail.com
On Sun, Mar 27, 2011 at 10:54 PM, hary rathor wrote:
> hello geeks:
>
> can any body tell me how structure padding work?
>
This code working fine in g++ compiler.
Here is the output: http://codepad.org/lEheQIkv
Compiler version : *C++*: g++ 4.1.2
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Thu, Mar 3, 2011 at 11:34 PM, Vishnutej
wrote:
> I dunno y dis code i
Hey Guys,
I just want to know the reason behind C++ forcess "constructors cannot be
declared virtual" as the virtual table construct during compile time itself.
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
--
You received this message b
hru
satu
sun
mon
tue
*wed*
thru
fri
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Mon, Feb 28, 2011 at 1:32 PM, Lavesh Rawat wrote:
> *Guess the Day Problem Solution*
> *
> *In one small town, there is a liar who lies on six days of
e 100.
It has to be with caller to decide how many number he has to print & the
definition will take care of algorithm.
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Tue, Mar 1, 2011 at 1:27 PM, sunny agrawal wrote:
> int i=1;
> #defin
plz do send me if you got any reply.
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Fri, Feb 18, 2011 at 7:37 PM, Umer Farooq wrote:
> Hello,
>
> Can anyone suggest me a good book for parallel algorithms?
>
> --
> Umer
>
>
26 matches
Mail list logo
