ayer 2/Layer 3 Testing,
scripting and Operating System.
·CCNA/CCNP is preferred.
*Thanks and Regards,*
*Staffing Team*
[image: cid:image003.png@01CFDCA7.31A4D950]
--
Sincerely,
Kranthi Raj A
9620246959
Fo
,
Raj Paul
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http://www.viprainfosystems.com
West Big Beaver Rd. Suite 200,Troy, MI 48084 USA
--
You received this message because you are subscribed to the Google
9000,
MPE/iX, MAC.
Thanks and Regards,
*Raj Paul*
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http://www.viprainfosystems.com
West Big Beaver Rd. Suite 200,Troy, MI 48084 USA
--
You received
Thanks and Regards,
Raj Paul
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http://www.viprainfosystems.com
West Big
and Regards,*
*Raj Paul*
*Sr. Technical Recruiter*
*Phone : 248-918-2510 EXT 1002*
*Email: rajp...@viprainfosystems.com rajp...@viprainfosystems.com*
*IM Gtalk Skype : rajpaul232*
*VipraInfoSystems |http://www.viprainfosystems.com
http://www.viprainfosystems.com*
*West Big Beaver Rd. Suite 200,Troy
# *
Thanks and Regards,
Raj Paul
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http://www.viprainfosystems.com
West Big Beaver Rd. Suite 200,Troy, MI 48084 USA
--
You received
Thanks and Regards,
Raj Paul
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http
9000,
MPE/iX, MAC.
Thanks and Regards,
*Raj Paul*
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http://www.viprainfosystems.com
West Big Beaver Rd. Suite 200,Troy, MI 48084 USA
--
You received
9000,
MPE/iX, MAC.
Thanks and Regards,
*Raj Paul*
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http://www.viprainfosystems.com
West Big Beaver Rd. Suite 200,Troy, MI 48084 USA
--
You received
Conversion specialist in at least one desired module
* Familiar with blueprinting methodologies and SDLC processes
Thanks and Regards,
Raj Paul
Sr. Technical Recruiter
Phone : 248-918
Thanks and Regards,
Raj Paul
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http://www.viprainfosystems.com
West Big Beaver Rd
*
Thanks and Regards,
Raj Paul
Sr. Technical Recruiter
Phone : 248-918-2510 EXT 1002
Email: rajp...@viprainfosystems.com
IM Gtalk Skype : rajpaul232
VipraInfoSystems |http://www.viprainfosystems.com
West Big Beaver Rd. Suite 200,Troy, MI 48084 USA
--
You received this message because you
When destroy called it will print garbage then it will print desired one.
Coz this pointer is self link but with different address of this pointer.
So after deletion of pointer this ...
On 5 Jun 2013 14:37, shubham saini shubhamsain...@gmail.com wrote:
#includeiostream
using namespace std;
not require its
use.
On Wed, Jun 5, 2013 at 9:21 PM, Nitish Raj raj.n...@gmail.com wrote:
When destroy called it will print garbage then it will print desired one.
Coz this pointer is self link but with different address of this pointer.
So after deletion of pointer this ...
On 5 Jun 2013 14:37
Ravi you r correct. Rope aka Cord.
On Sun, May 26, 2013 at 9:36 AM, Ravi Ranjan ravi.cool2...@gmail.comwrote:
Rope
On Sat, May 25, 2013 at 10:24 PM, Nishant Pandey
nishant.bits.me...@gmail.com wrote:
In one of the interview it was asked, can some one suggest good DS for
this.
Thanks
steps:
1) make max heapify and min heapify for first k days
2)for the next day... remove first element from max heapify and min
heapify then add new element to existing max heapify and min
heapify .
3) Then return max and min in O(1)from max heapify and min heapify .
PRAVEEN RAJ
DELHI
plz explain ur ans .how it is calculated?
On Sat, Jul 7, 2012 at 12:54 PM, Amol Sharma amolsharm...@gmail.com wrote:
Three 0's and Three 6's.
36 possibilities and 12 possible values of sum, so each sum should come in
3 possibilities and hence three 0's and three 6's.
--
Amol Sharma
l value - address
r value - content of variable(value)
ex-
x=2
x has value and address
but 2 has only value
cout++x++
I think this will result into l error .
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm
array of bits?
if the current integer is present set the bit if else make it zero,
searching, insertion and deletion all in O(1) time.
On Thu, May 24, 2012 at 4:15 PM, rishabh shukla rockrishabh.mn...@gmail.com
wrote:
Suggest a data structure for storing million trillion numbers efficiently
use trie trees, and for every word sort the word and store the sorted word
in the trie tree and also keep the index of that word in leaf of trie
tree..after traversing the whole list of words you'll have all the indices
of a anagrams of a particular word in its leaf nodes.
On Fri, May 11, 2012
if asking me..yes !!
On Fri, May 11, 2012 at 5:27 PM, Raghavendhra Chowdary MV
raghavendhra20061...@gmail.com wrote:
Is this amazon question buddy??
On Fri, May 11, 2012 at 5:24 PM, mayur mayursa...@gmail.com wrote:
Hi all,
I am stuck with a question for a long time...can someone provide
Ya tournament tree is fine, you can even check it on
http://www.geeksforgeeks.org/archives/11556
To decide a winner among N people, ( n-1 ) people should loose. So N-1
games will decide.
On Mon, Apr 9, 2012 at 12:45 AM, SAMM somnath.nit...@gmail.com wrote:
This can be done using Tournament
how can there be multiple spikes and valleys??
say
1 2 3 4 5 6 7
if you rotate it once with rotation index 3
4 5 6 7 1 2 3
then again with index 2
6 7 1 2 3 4 5
So the multiple times rotation just means that the index of rotation is
more then 1.
On Fri, Apr 6, 2012 at 7:02 AM, Ashish Goel
Can you please explain the question again.
As what I understood according to me the question is size of array : n and
the range of the elements present at each location is log n.
On Wed, Apr 4, 2012 at 2:57 AM, Doom duman...@gmail.com wrote:
Any ideas?
--
You received this message because
How would you find the area of a polygon in O(n) time? Of course
thereis this way of using the formula, but it doesnt quite work out in
case of Self intersecting polygons. One could maybe divide it into
triangles and then solve it, but that'd require for one to sort the
vertices first which would
horizontal
distance, 5 being the right child of 2 ( which is at -1 distance ) is again
at -1 + 1=0 horizontal distance, similarly 6 will be at +1-1 =0 Horizontal
distance.
Hope that helps.
Thanks and regards,
Aman Raj
On Sat, Mar 17, 2012 at 3:29 PM, rahul sharma rahul23111...@gmail.comwrote:
what
HIII
CAN ANY BODY TELL ME
WHAT KIND OF PUZZLE ASKED IN COMPRO TECH INTERIVEW
AUR WHAT R THE SUBJECT AND KIND OF QUEST. THEY ASKED IN COMPRO CAMPUS
INTERVIEW IN DELHI
PLZ ANSWER asap
THANKS
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
It will be very helpful if u could tell me for binary search tree and
binary tree both...
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
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
mirror of tree
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
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 from this group, send email to
algogeeks+unsubscr
choose greedy algorithm... in in minimum spanning tree..
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
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 from this group
Steps:
1)Reverse the list ...
2)Now do the swap two nodes... consecutively...
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
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
Idea:
1)Take count =0;
2) make Outer loop ...and search for 1's .
3) Start ...searching for 1 consecutively...
and make it ..0 untill all consecutive 1's becomes 0..
and then count++
4) go to 1) untill all 1's finished..
count will give the total number of islands...
PRAVEEN RAJ
hello world must be o/p... but don't understand abt the o/p in ideone...
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
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
This can be done... k way merge...
c- number of columns
r- number of rows
In O(c*r*log(r))
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
name it.
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
On Wed, Jan 25, 2012 at 12:45 AM, atul anand atul.87fri...@gmail.comwrote:
@Praveen : i have doubt in your algo...it seem it may fail for some
cases...
On Tue, Jan 24, 2012 at 5:59 PM, praveen raj praveen0...@gmail.comwrote:
Idea:
1
Answer is already given in group search it...
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
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 from this group, send
run the randomized partition...and find (n-k)th smallest according
to frequency.take k elements... below it...have most frequent
elements
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
this is like a DP problem to me
1) build a 2 D array .
2) store If difference b/w any two number is = K then M[i,j]=1
else M[i,j]=0
3) Now find max size square (containing all ones) by using Dynamic
Programming.
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message
);
}
}
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
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 from this group, send email to
algogeeks+unsubscr...@googlegroups.com
yes... right...
i forget to remove this statement..
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
On Fri, Dec 30, 2011 at 2:17 PM, Lucifer sourabhd2...@gmail.com wrote:
@praveen
I think what u are doing above is the following:
Say, F(n) denotes the no. of binary trees that can be formed
The Question is: whther there exist a even length pallindrome or not
since for even ... the two consecutive character will be equal...
so find two character which are equal.. consecutively..
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you
IT will grt help for me... if u all tell me..
mapstring,int m;
m[topcoder]=2
My question is this:
Is 2 is an key value??or index value of hash table...??...
kindly explain how actual mapping is done... in hash table...plz...
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
On Tue, Dec 27
the element row wise.. .
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
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 from this group, send email to
algogeeks+unsubscr
Procedure:
1.if out of boundary return 0;
2.If reach final point return 1.
3.if(next point has no obstacle then go for it.. recursively)
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
@atul I am not sure whether I got ur question correctly.If you only want to
check whether an even palindrome exist or not,then u can check for whether
adjacent characters are same or not.It is very simple.If you want the
longest string then its gets difficult.Same algo can be also used for
@atul If we need to find the longest palindrome whether even or odd we can
use DP.The recursion can look this:
LP(i,j) = max( LP(i+1,j),LP(i,j-1) if(string[i]!=string[j])
max( LP(i+1,j),LP(i,j-1),LP(i+1,j-1)+1 ) else
Note : Do
Hashmapping O(n)
On 25-Dec-2011 2:15 AM, sravanreddy001 sravanreddy...@gmail.com wrote:
any better approach than O(N log N) time?
maintain a heap of nodes value, count
for each element, if already present increase the count. Else add the
elements.
Max-Heap -- fetch the node, print it
@shamm:it means if we want for triplet do we nd 2 go for 3 time
multiplication of polynomial and den division of coefficient by 3..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
@saurav: if you dnt mind cn i c ur code...like earlier your post was also
related to f(n) bt it wz out f d limit
--
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
#includestdio.h
#define s(n) scanf(%d,n)
#define I int
I a[14][14];
I d(I m,I n)
{
I s=a[m][n];
I k;
if(!m||!n)
k=1;
else if(s)
k=s;
else
{
k=d(m-1,n)+d(m,n-1);
s=k;
}
return k;
}
main()
{
I t,n,k;s(t);
while(t--)
{
s(n);
k=d(n,n);
printf(%d\n,k);
}
}
@saurav:this is the actual and very simple
@samm:tnx dude lemme first chk it...den i wl b able 2 discuss it
further.
--
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 from this group, send email to
@samm:i hv googled it several time bt by code no path r ways as a tag bt
cudnt get ne link..cn u plz paste the link here.i jst
want 2 do ittnx in advnce
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
@samm:you are checking for each sum between min sum and max sum in each
loop we are skipping several triplets(sum) which hai intermediate
sum..this is also a o(n^3) brute-force almost...i have written
a code jst c it .can u think in this direction so dat we wl b able
hey dude jst paste the link of ways(paths-120 bytes) you told its on google
but i cudnt find it.tnx
--
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 from
this is my almost working code for spoj mayca ...can anyone suggest me
anytest cases.for which it is not working.tnx in advance
#includeiostream
#includecstdio
#includecstring
using namespace std;
char
hey ,i got the bug and got AC ALSO..there was
several bugs ...sry ,for silly dbt
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
shashank.dude the algorithm whch u suggested in the morning for
tsum ...hv u tried it wid urself bcoz wid the wiki link method
if we wl sort the array den wat b the delimiter so that ,i wl get get all
combination of 3 .in dat method dat wz given for sum of three
we have to submit it in 120 byte cn ne 1 tl me dat whr z the chances of
further byte reduction in this code.
#includestdio.h
#define s(n) scanf(%d,n)
#define I int
I a[14][14];I d(I m,I n){I s=a[m][n];I k;if(!m||!n)k=1;else
if(s)k=s;else{k=d(m-1,n)+d(m,n-1);s=k;}return k;}main(){I
hey guys ,i am trying to solve TSUM ..on spoj...
http://www.spoj.pl/problems/TSUM/.in which we have to find the sum of any
triplets in n numbers.can any one suggests me any approach other
than brute-force of (n^3)..
..thanks in advance
--
HEY DUDE TNX FOR THE REPLY .CAN YOU PASTE ME THE LINK FOR THAT
WIKI PAGE.
--
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 from this group, send
N!/2
On 03-Dec-2011 11:30 PM, Dipit Grover dipitgro...@gmail.com wrote:
^ we need to count each permutation and its reverse together as one
possibility since both would result in identical mst.
--
Dipit Grover
B.Tech in Computer Science and Engineering - lllrd year
IIT Roorkee, India
,
Praveen Raj
DCE-IT
735993
praveen0...@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 from this group, send email to
algogeeks+unsubscr
in increasing order... .. so on popping the
element... will pop the topmost element(with the highest priority
value)..
on pushing the element... push the element... with the priority value more
than topmost priority value...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0
amount displaced by (boat +man + suitcase) = amount displaced by
(boat+man) + amount displaced by suitcase
therefore no change of level...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Thu, Sep 15, 2011 at 4:24 PM, hary rathor harry.rat...@gmail.com wrote
@jitesh rightly said... since there is no limit of depth...
we can go for BFS..
we can reduce space by comparing A's and C's profile...
whatever is common ... we can use it to find connection... between A and C
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
if length is even : then every element must occurs even times
if length is odd : then every element must occurs even times except one
element occurs odd...
With regards,
Praveen Raj
DCE-IT
735993
praveen0...@gmail.com
--
You received this message because you are subscribed to the Google
grt :)
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@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 from this group, send email
int func(int x)
{
int y=(1i)+(1j);
int z=xy;// if after bitwise and ..we get power of 2 then ...
we have to flip the bits..
if((z(z-1))==0)
return(x^y);
else
return x;
}
With regards,
Praveen Raj
DCE-IT
735993
praveen0...@gmail.com
--
You received
+1 Gene
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Wed, Sep 28, 2011 at 1:36 AM, Gene gene.ress...@gmail.com wrote:
Indeed you must be given that all the array elements are unique or at
least that there are no more than floor(n/2) repeats). Otherwise
)...
With regards,
Praveen Raj
DCE-IT
735993
praveen0...@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 from this group, send email to
algogeeks
()
{
func(7,127);//left for N0 and and right for K..chech for any other
values
getch();
return 0;
}
Tell me .. if u find any test cases failed...Thankx...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Wed, Oct 26, 2011 at 1:56 PM, praveen raj
good question..
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Tue, Sep 27, 2011 at 6:40 AM, Kunal Patil kp101...@gmail.com wrote:
Nice question nice answer... :)
On Tue, Sep 27, 2011 at 6:25 AM, UTKARSH SRIVASTAV
usrivastav...@gmail.com wrote:
what's
N=(N( (~0j) | (~(1i))) | (Mi)
With regards,
Praveen Raj
DCE-IT
735993
praveen0...@gmail.com
On Tue, Oct 25, 2011 at 11:46 AM, Bittu Sarkar bittu...@gmail.com wrote:
N = (N | ((1(j-i+1)-1)i) (Mi);
On 12 October 2011 01:22, prasad jondhale jondhale.pra...@gmail.comwrote:
grt
problem 4.. good question...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Tue, Oct 25, 2011 at 5:57 PM, kumar raja rajkumar.cs...@gmail.comwrote:
Problem 1: Remove duplicate elements from an unsorted array of size N
Problem 2: Find intersection of K unsorted
I will choose the point where amount of fuel is maximum choose the
shortest path from two direction (clockwise or anticlockwise)..
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Mon, Oct 24, 2011 at 4:36 PM, Aniket aniket...@gmail.com wrote:
Suppose
Its like a queen problem ...with row and column are not same..
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Tue, Oct 18, 2011 at 12:06 AM, Don dondod...@gmail.com wrote:
Given a cost matrix with N columns and M rows such that M=N, find the
K lowest total cost
)
coutijk;
}
}
}
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Mon, Oct 24, 2011 at 3:00 AM, Piyush Kapoor pkjee2...@gmail.com wrote:
Suppose u choose ith element from the Kth set,then
dp[K][Sum]=sum(from i=0 to number of elements in the Kth
N2 would me minimum
On 13-Oct-2011 11:08 PM, ravindra patel ravindra.it...@gmail.com wrote:
Hi,
Another question I faced in Amazon F2F.
Given an unsorted array of integers, find all triplets that satisfy x^2 +
y^2 = z^2.
For example if given array is - 1, 3, 7, 5, 4, 12, 13
The
someone please reply
--
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 from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options,
* Which of the following restricts a process to the memory allocated to it*
*
*a. stack pointers
b. memory allocation hardware
c. kernel
d. none of these
what's the answer of this question
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
Kernel.
On 08-Oct-2011 11:33 AM, raj kumar megamonste...@gmail.com wrote:
* Which of the following restricts a process to the memory allocated to it
*
*
*a. stack pointers
b. memory allocation hardware
c. kernel
d. none of these
what's the answer of this question
--
You received
Plz put more question that has beem asked in citrix.
On 08-Oct-2011 11:33 AM, raj kumar megamonste...@gmail.com wrote:
* Which of the following restricts a process to the memory allocated to it
*
*
*a. stack pointers
b. memory allocation hardware
c. kernel
d. none of these
what's
Plz put the technical written paper pattern ...of sourcebit... and some
sample papers...of what type of questions(level) would be asked...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Make two conditions for even and odd power. and use it to make solve
higher power
That could be solved in log b time
.
On 30-Sep-2011 4:12 AM, Dave dave_and_da...@juno.com wrote:
@Don, Ankuj. I believe that Don's algorithm uses precisely
floor{log_2(b)) + (the number of one bits in b) -
Take two array... one will take care of left products... and othr will take
care of right product.. at any index left[i]=A[i-1]*left[i-1] starting
from left and right[i]= A[i+1]*right[i+1] starting frm right……
--
You received this message because you are subscribed to the Google Groups
@don we dnt hve ny info about arrangement...
--
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 from this group, send email to
Ptr cannot be used to allocate block of memory
.. void pointer use only to store address...
--
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 from this group, send
@nitin Plz explain how u have reached answer of question no. 4 and 6
On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com wrote:
Answer 3 - 100
Answer 6 - 103
Answer 4 - 194 total processes including the parent
Answer 7 - 12 km south, 12 km east
On Sun, Sep 18, 2011 at 11:53 PM,
:
@Nitin: Answer to question 3 is 50.
On Mon, Sep 19, 2011 at 11:44 AM, praveen raj praveen0...@gmail.com
wrote:
@nitin Plz explain how u have reached answer of question no. 4 and 6
On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Answer 3 - 100
Answer 6 - 103
, 2011 at 2:47 PM, praveen raj praveen0...@gmail.com
wrote:
For question 2 see ashima link.
On 19-Sep-2011 1:43 PM, Nitin Garg nitin.garg.i...@gmail.com wrote:
Can someone tell answers to question 2 and 5 with explanation??
On Mon, Sep 19, 2011 at 1:40 PM, Nitin Garg nitin.garg.i
to elimination of
any
other player.
So, min 2 matches for every player who is to be eliminated, hence 100.
On Mon, Sep 19, 2011 at 11:54 AM, Bhanu Chowdary
bhanuchowd...@gmail.com wrote:
@Nitin: Answer to question 3 is 50.
On Mon, Sep 19, 2011 at 11:44 AM, praveen raj praveen0...@gmail.com
Yes u r saying correct .
On 19-Sep-2011 6:39 PM, teja bala pawanjalsa.t...@gmail.com wrote:
Why do we pass a reference for copy constructors?
If it does shallow copy for pass by value (user defined object), how
will it do the deep copy?
Ans:- if we don't pass the reference, every time a
Use trie.
On 19-Sep-2011 8:20 PM, Sangeeta sangeeta15...@gmail.com wrote:
given an array of characters without spaces and a dictionary.All valid
dictionary words must be found and printed.
i/p : BANKERKCATXYWOMAN.
o/p: BANK
BANKER
CAT
WOMAN
MAN
(the only function you could use for
This will show syntax error due to x==9 and otherwise since memory address
given at the declarAtion there fore x value will. Change at every
assignment , but i m not sure printf will give an error or not . Plz reply.
On 17-Sep-2011 1:13 AM, Anshul AGARWAL anshul.agarwa...@gmail.com wrote:
*Write a program to find out the combination of an element of each
array gives a result 0.*
For example:
array 1: {2,1,4,7}
array 1: {3,-3,-8,0}
array 1: {-1,-4,-7,6}
Output:
pairs =
{2,-8,6}
{1,3,-4}
{4,-3,-1}
{7,0,-7}
--
You received this message because you are subscribed to the Google
program to find the top 3 repeating number from the given array
eg
You r given an array and u have to find out the top 3 repeated
numbers.
for ex: GAURAV[]={20,8,3,7,8,9,20,6,4,6,20,8,20}
so the output will be: 20 is repeated 4 times 8 is repeated 3 times 6
is repeated 2 times.
--
You received
InfoEdge is going to visit in my collage.
Anyone knows which type of question ask in written test and interview.
--
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
it... but we have to care of freeing trie ... list after searching
for the given substring.
KMP approach : would be otherwise... better
With regards,
Praveen Raj
DCE-IT 4th yr
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
Can anyone explain me approach. how u r calculating..it...
With regards,
Praveen Raj
DCE-IT 3rd yr
--
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 from
With regards,
Praveen Raj
DCE-IT 3rd yr
--
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 from this group, send email to
algogeeks+unsubscr...@googlegroups.com
1 - 100 of 343 matches
Mail list logo
