.
That interviewer didnt needed the code bt the approach.I first told him to
hash the threads based on memory location and search for memory clash
threads for that memory location,bt he was not understanding how it can be
implemented for large no. of threads.
--
*Dheeraj Sharma*
--
You received
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
How to check if one binary tree is a sub tree of other?
Any Solution other then bruteforce?
Prototype
bool check(node *t1,node *subtree)
--
Sent from my mobile device
*Dheeraj Sharma*
--
You received this message because you
How to check if one binary tree is a sub tree of other?
Any Solution other then bruteforce?
Prototype
bool check(node *t1,node *subtree)
--
Sent from my mobile device
*Dheeraj Sharma*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
How to check if one binary tree is a sub tree of other?
Any Solution other then bruteforce?
Prototype
bool check(node *t1,node *subtree)
--
Sent from my mobile device
*Dheeraj Sharma*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
/ \
34
/
9
?
On Tue, Mar 20, 2012 at 5:54 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
How to check if one binary tree is a sub tree of other?
Any Solution other then bruteforce?
Prototype
bool check(node
at each node which would ultimately find no matching sub
tree.
If they are binary search trees, it could be more efficient. Did you
mean to ask about binary search trees?
Don
On Mar 20, 7:24 am, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
How to check if one binary tree is a sub tree
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
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 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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You received this message
://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
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
/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
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
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
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 unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
approach then O(n^2)
--
*Dheeraj Sharma*
--
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
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You
element grater than equal to 4 in the subarray 532 is
5.
3) Swap (4,5) : 14532 - 15432
4) Now, as we have identified in step 1 the index of i, we need to
reverse the array from A[i+1, n] i.e. in 15(432) (432) needs to be
reversed and hence we will get 15234...
On Dec 11, 12:43 pm, Dheeraj Sharma
this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group
email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You received this message because you are subscribed
, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
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
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
of above
question)
--
*Dheeraj Sharma*
--
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
they are on same level..i am providing answer to your
problem in attached file..
check that out..
*Raghav garg
On Tue, Oct 4, 2011 at 1:53 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
1.How to construct a tree from the list representation
for ex.- construct tree from (A(B(E(K,L),F
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
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
, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
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
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group
to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
--
You received this message because you are subscribed to the Google
for
for 3 answer=?
nd for 4 answer=?
Sanju
:)
On Sat, Sep 24, 2011 at 10:39 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
can u plz be more..clear ..with wat the input will consist of..
wat does this mean
for 2 answer=55
does that mean..that how many non decreasing digits can
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
it has some errors..lemme modify it
On Sun, Sep 25, 2011 at 10:45 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
Q1
int fun(int arr[],int left,int right,int num)
{
int mid=(left+right)/2;
if(mid==0)
return 0;
if(mid==num-1)
return 1;
if( arr[mid]arr[mid
0 2 5
ending_index 1 4 6
and so on i hope its much explained...
On Sat, Sep 24, 2011 at 10:30 AM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
char str[100],t;
scanf(%s,str);
char ch='0
://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
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 unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
You received this message because you are subscribed to the Google Groups
://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
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
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
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
... ya u r ryt thnxs for the correction
On Thu, Sep 22, 2011 at 1:30 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
@Ratan:
i think the next largest here would be 784559
On Thu, Sep 22, 2011 at 12:39 PM, Ratan success.rata...@gmail.com
wrote:
@kartik : to some extent ur code
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
You received this message because you are subscribed to the Google
;
}
getch();
}
On Thu, Sep 22, 2011 at 3:42 PM, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
for 2nd one
#includeiostream
#includeconio.h
using namespace std;
int main()
{
char str[100];
cinstr;
char ch=str[0];
int count=0,i=0
;
arr[i]=min;
i++;
}
i=len-1;
while((arr[i]==i)(i0))
i--;
swap(str[i],str[arr[i]],t);
if(i0)
quicksort(str,arr[i]+1,len-1);
coutstr;
getch();
}
On Thu, Sep 22, 2011 at 3:33 PM, Dheeraj Sharma dheerajsharma1...@gmail.com
this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
in
sorting as well (similar to counting sort).
One pass will do the work. You can print the answer directly
afterwards.
With Regards
Unknown
On Thu, Sep 22, 2011 at 4:13 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
in nlog(n)
#includeiostream
#includeconio.h
at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
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
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT
ans 7. - 15 km east and 12 km south of origin
On Sat, Sep 17, 2011 at 11:29 AM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
Ans 8. 62.5 % ???
On Sat, Sep 17, 2011 at 9:11 AM, VIHARRI viharri@gmail.com wrote:
1. Minimum no.of comparisons required to select the 2nd max element
: i think 2n but may be better solution is posible
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Fri, Sep 16, 2011 at 11:19 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
ans 7. - 15 km east and 12 km south of origin
On Sat, Sep 17, 2011 at 11:29 AM
12 west and 10 south.. i thnk..is the correct one..
On Sat, Sep 17, 2011 at 5:22 PM, Yogesh Yadav medu...@gmail.com wrote:
yeah it will be 62.5%
On Sat, Sep 17, 2011 at 5:14 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
@ashima...its asking just for pens..and that of alam..so
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj
://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
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
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message
can anyone tell me the procedure for IOCL?
paper nd all
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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 at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
ups...19 i guess
On Wed, Sep 7, 2011 at 9:52 PM, Dheeraj Sharma
dheerajsharma1...@gmail.comwrote:
wats the ans... 21??
On Wed, Sep 7, 2011 at 9:42 PM, vivek goel vivek.thapar2...@gmail.comwrote:
can anyone explain me how?? plsss
On Wed, Sep 7, 2011 at 9:40 PM
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg
yeah same as sukran..
On Mon, Sep 5, 2011 at 7:55 PM, Dheeraj Sharma
dheerajsharma1...@gmail.comwrote:
placing 0 before the numbers..makes it in octal notation...
On Mon, Sep 5, 2011 at 7:48 PM, Mohit Goel mohitgoel291...@gmail.comwrote:
1) #include stdio.h
#include stdlib.h
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg
for '?' u just increment ur pointer(which is returned by previous one.) by
1..
On Sun, Sep 4, 2011 at 12:09 AM, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
for * it can be like.. for example we have any string say *ab*c*de*
it is composed of three strings ..that has to be searched.in
initialize array keeping count?
On Sun, Sep 4, 2011 at 12:03 AM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
count sort in reverse order would help i guess :)
On Sat, Sep 3, 2011 at 11:49 PM, mohit verma mohit89m...@gmail.comwrote:
Ohh my bad. the complexity should be
O(nlogn) + O(mlogm
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
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
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because
considering
On Wed, Aug 31, 2011 at 9:32 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
8 3 is correct..winshuttle mein aaya tha ;)
On Wed, Aug 31, 2011 at 9:30 PM, aditi garg aditi.garg.6...@gmail.comwrote:
No sizeof ignores \0
On Wed, Aug 31, 2011 at 9:27 PM, SANDEEP CHUGH
A doubly linked list has one Left pointer missing and at some point..one
Right pointer missing..how to repair the doubly linked list?
?
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
?
Sanju
:)
On Wed, Aug 31, 2011 at 9:23 AM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
A doubly linked list has one Left pointer missing and at some point..one
Right pointer missing..how to repair the doubly linked list?
?
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91
* curr = tail;
while (curr-left != null) {
if (curr-left-right == null) {
curr-left-right = curr;
}
curr = curr-left;
}
On Aug 31, 10:23 am, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
A doubly linked list has one Left pointer missing and at some
point..one
Right pointer
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp
the end of
the list... Short of scanning the entire heap to find some memory that
contains node4's address (somehow) that data is just inaccessible and
orphaned now.
On Aug 31, 10:44 am, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
i get more clear to my quest..
1.Doubly Linked List
2
options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you
, Aug 30, 2011 at 12:04 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
yeah it came yesterday..the paper was very easy
1.u have to find loop in linked list..
2.u are given a number..you have to print it down to zero(subtracting 5)
and then print from 0 to that number(adding 5) without
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because
://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received
this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
whole array.
6 7 8 1 2 3 4 5.
solution for anti-clockwise :
See Reverse first k and last n-k numbers e.g.
3 2 1 8 7 6 5 4
now reverse whole array.
4 5 6 7 8 1 2 3
Hope u got it.
Sanju
:)
On Fri, Aug 26, 2011 at 10:49 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
How
?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
ans is 20
*Stop Cramming Start Thinking*
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message
How to rotate 1d array of length clockwise 'k' times??
(1,2,3,4,5,6,7,8)-(4,5,6,7,8,1,2,3) for k=3 n= 8
Give solutions which do not swap the array k times!! i.e less than O(nk)
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT
, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm
/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
ok thanks
On Wed, Aug 24, 2011 at 10:02 AM, Dave dave_and_da...@juno.com wrote:
@Dheeraj: Because there are 98 numbers between 1 and 100. They are 2,
3, 4, ..., 99. It is a matter of semantics. 1 and 100 are not between
1 and 100.
Dave
On Aug 23, 11:21 pm, Dheeraj Sharma dheerajsharma1
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg
email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received
to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
1 - 100 of 103 matches
Mail list logo