om)
>
> On Tue, Oct 23, 2012 at 2:06 PM, saket
> > wrote:
>
>> There is one linked list having two pointer one as usual next and other
>> is random pointer pointing to any random node in list.
>> write algo to make a duplicate of it.
>> Note:- Original list is con
We have a long chain of cuboids in all the six directions (six faces). One
start node is given and one end node is given. Give a data structure to
represent this also search for the given node from start node.
--
You received this message because you are subscribed to the Google Groups
"Algori
There is one linked list having two pointer one as usual next and other is
random pointer pointing to any random node in list.
write algo to make a duplicate of it.
Note:- Original list is const, Can't be modified.
i know O(n) solution when list can be modified , and o(n^2) when list can
be modif
some one with infibeam visited their college please tell their proceure and
also give some questions asked in written and interviews .
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.g
some one please tell infibeam recruitment process this year,also tell some
questions if possible.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/dVM0MrjRA
As far as I have googled about the 'game of life' problem, of which
this question is a variant ; no mathematical pattern/series emerges
out of it ...
but in this problem since the moves are defined in a 3*3 grids, I
found some test cases where the board configurations do not change
after certain k
Just type "vlc" in terminal. Else if you want to run it as root : "sudo vlc"
Sent from my iPhone
On Sep 4, 2011, at 1:31 PM, UTKARSH SRIVASTAV wrote:
> hi anyone knows how to play vlc in root .i know root is
> not allowed by default but i want to know some mean
>
> --
16x=15y. Multiple solutions. Actually Infinite.
On 19 July 2011 23:58, shiv narayan wrote:
> There is a temple, whose premises have a garden and a pond. It has 4
> idols, each of Ram, Shiv, Vishnu and Durga. The priest plucks x
> flowers from the garden and places them in the pond. The number of
^The condition if d < r0+r1 means the circles are intersecting hence theres
no way a bigger circle will overshadow the smaller circle which will happen
only whne d < abs(r1-r0)
On 20 July 2011 00:00, Piyush Sinha wrote:
> Just a simple thoughtI am assuming all points are unique
>
> Creat
Ya. Have an extra array of size(nxn). the one that I have implemented above.
--
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
algog
Ruby Solution for 1d array. The logic for 2d array remains same.
a=[1,2,3,4,5,1]
b=[]
for m in a
unless b.include?(m)
b< wrote:
> Have a hash Table. Read the elements and push it to the hash table. If it
> alraedy exists you are done.
>
>
> On 19 July 2011 01:02, Shubham Maheshwari wrote:
>
Have a hash Table. Read the elements and push it to the hash table. If it
alraedy exists you are done.
On 19 July 2011 01:02, Shubham Maheshwari wrote:
> what would be the O(n^2) sol. to this ...!!
>
>
> On Tue, Jul 19, 2011 at 12:41 AM, snehi jain wrote:
>
>> can it be solved in less than O(n^2)
Use logarithms and the properties that follow.
Let the number be n
Find log to the base 5 of n =*X*= *log*(n)/*log*(5) here *log* refers to
base 10
Find log to the base 9 = *X*/(log to the base 5 of 9)
Done!
On 18 July 2011 23:58, varun pahwa wrote:
> is there any direct conversion possible like
Yeah if they are in some order then its possible doing it in O(n) else
reading should itself take O(n^2) in the worst case.
On 18 July 2011 23:54, ankit sambyal wrote:
> Are the elements of the array in some order, or are they random ?
>
> --
> You received this message because you are subscribe
^*constraint is not using division operator*
*
*
*
*
On 18 July 2011 01:44, hary rathor wrote:
> assume that ; all element in array are short integer;
>
>
>
> int i;
> long long long long long int multi=1;
> for(i=0;i {
> multi*=a[i];
> }
>
> for(i=0;i {
> out[i]=mul[i]/a[i];
> }
>
> O(n)
>
> --
15 matches
Mail list logo
