Hi,
Can anybody help by sharing MS online test pattern and questions ?
I have heard they have also included aptitude questions this time, is that
right?
Thanks
--
Sanchit Mittal
Fourth Year Undergraduate
Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received
/algogeeks?hl=en.
--
Regards
Amit Mittal
--
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
Ntn else is provided..??
On Feb 28, 2012 12:51 PM, Gaurav Popli abeygau...@gmail.com wrote:
Given a sequance of natural numbers.
Find N'th term of this sequence.
a1=2, a2=4, a3=11, a4=36, a5=147, a6=778 ... ... ... ... aN.
this is a coding quesn and O(n) soln is also welcome...
--
Regards
--
Sanchit Mittal
Third Year Undergraduate
Computer Engineering
Delhi College of Engineering
ph- +919582414494
Stanford Online Study – Win an iPad 2
The MobiSocial Computing Lab at Stanford University is inviting people to
participate in a really cool online study. Please sign up
+1 Prem
@ligerdave : I knew about the recursion method..but can u throw some light
on the pointer based method..(with a small example maybe)..
Specifically I wanted to know the implementation part and the running time
of the algorithm.
On Wed, Oct 26, 2011 at 8:33 PM, ligerdave
Fibonacci Heaps
On Fri, Sep 30, 2011 at 9:14 PM, manish kapur manishkapur.n...@gmail.comwrote:
u have to perform following tasks in O(1) time
1.)insertion
2.)deletion
3.)searching
no range of input numbers is given
wat data structure will you use?
if u use hashing wat will be the key and
plz send me that book too
On Mon, Sep 26, 2011 at 3:28 PM, Ishan Aggarwal
ishan.aggarwal.1...@gmail.com wrote:
plz send me that book to
I also need that book...
On Sun, Sep 25, 2011 at 9:37 PM, sarath prasath
prasathsar...@gmail.comwrote:
hi every one..
pls do give me the link
double sqrt(double c)
{
if (c 0) return error;
double err = 1e-15;
double t = c;
while (fabs(t*t - c) err)
t = (c/t + t) / 2.0;
return t;
}
On Sun, Sep 25, 2011 at 2:57 PM, teja bala pawanjalsa.t...@gmail.comwrote:
@vikram
the one which i posted(link) it was newton raphson method which
Hello yar,
Please share the written paper format and interview questions.
If dont want to display openly, plz share with my id mohitm.1...@gmail.com.
It will be of great help to me.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this
Has anyone recently attended the placement procedure for paypal.
Like how is it?
--
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/-/WzkQbuBpGlkJ.
To post to
If i have to code the functioning of grep
what data structure is recommended for implementing it.
I was thinking may be using trie with each node having a vector list of line
numbers in which they appear.
Is it the correct one or is there any better solution to this.
--
You received this
around 25th
65
arnd 8
--
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/-/7FtN8hsesrgJ.
To post to this group, send email to algogeeks@googlegroups.com.
To
Please upload this book, if anyone of you have it.
On Fri, Aug 19, 2011 at 7:59 AM, Swati Sarraf swati1...@gmail.com wrote:
Hey Navneet , which book are you talking abt- Data structure and algo made
easy OR Data structure Puzzles ?
Rahul,
This is not the complete book, it has just two chapters. Can you provide a
link for the entire book ?
On Sat, Sep 3, 2011 at 6:28 PM, Rahul Verma rahulverma@gmail.comwrote:
download the book from:
This might help
http://publib.boulder.ibm.com/infocenter/comphelp/v8v101/index.jsp?topic=%2Fcom.ibm.xlcpp8a.doc%2Flanguage%2Fref%2Fcplr130.htm
\
On Mon, Aug 22, 2011 at 11:40 AM, Sanjay Rajpal srn...@gmail.com wrote:
Here concept of v-tables comes into picture. Refer to C++ Primer Plus by
I have my google interview at the end of this month.
can any body provide me some tips/suggestions/questions ?
I am sure some of you guys here must have appeared in google interviews
before,
your help will be very valuable and much appreciated.
Thanks
--
You received this message because you
www.spoj.pl/problems/BST/
--
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,
dynamic programming with binary search should do it..
Regards
VM
NSIT, COE, 3rd yr
On Tue, Aug 2, 2011 at 6:19 PM, Kamakshii Aggarwal kamakshi...@gmail.comwrote:
@sunny:yes all the squares should be of same size
On Tue, Aug 2, 2011 at 5:03 PM, Poised~ dip10c...@gmail.com wrote:
@ narain-
i think for rabbit question answer is 128
as always 2 new rabbits are born from a couple ever alternate month
so at end of 1st month 2
2nd month 4
4rd month 8
6month 16
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*With Regards *
*RAHUL MITTAL*
*3rd YEAR*
*CSE*
*MNNIT ALLAHABAD*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
:31 am, rahul mittal rahulmitta...@gmail.com wrote:
maintaining the bst of n element in worst case will take n square time
complexity ..do we have a better solution for worst case
On Sun, Jul 31, 2011 at 12:53 AM, sukhmeet singh sukhmeet2...@gmail.com
wrote:
nivedita: wts
help me with this
we need to find out how many times a function is recursively called
while inserting a node in bst.
insert (number X, node N)
increase the counter C by 1
if X is less than the number in node N
if N has no left child
@abhi
we can do it without passing the address to a function. just store the
address of const variable in another variable and change the value...
On Mon, Jul 18, 2011 at 11:56 AM, Abhi abhi123khat...@gmail.com wrote:
Perhaps the only way to alter the value of a variable declared constant in
C
1.Calculate XOR of all the array elements.
2.XOR the result with all numbers from 1 to n =x1
3.After 2nd step, all elements would nullify each other except 2 missing
elements(let x and y) and x1 will contain XOR of x and y
4.All the bits that are set in x1 will be set in either x or y. Get the
@ankit...i m assuming that array of size n contains n-2 elements with 2
elements missing
On Mon, Jul 18, 2011 at 6:07 PM, SAMMM somnath.nit...@gmail.com wrote:
#includestdio.h
int main()
{
int a[]={1,2,3,5,2}; // 2 isrepeated and 4 is missing
int i=0,x=0,j=0,bit;
while(i5)
{
ok then 1st remove duplicates from the array in O(n) then apply my algo...
On Mon, Jul 18, 2011 at 6:13 PM, ankit sambyal ankitsamb...@gmail.comwrote:
@Nishant: Read the question carefully. It says Each number is present
at least once except for 2 numbers.
--
You received this message
@SkRiPt KiDdIe... I think you need to analyze my algo again it will work
for both the cases...
On Mon, Jul 18, 2011 at 6:33 PM, SkRiPt KiDdIe anuragmsi...@gmail.comwrote:
Nishant. Your algorithm works for finding repeated nos. in a [n+2] array
where [1-n] are present atleast once and the
@ankit for removing duplicates=O(n)+O(n)
On Mon, Jul 18, 2011 at 6:36 PM, ankit sambyal ankitsamb...@gmail.comwrote:
@nishant : Time complexity ?? will increase too much
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
and for finding missing 2 elements= O(n)+O(n)+O(n)+O(n)
so total will be O(n)
but there will be no overflow
On Mon, Jul 18, 2011 at 6:41 PM, Nishant Mittal
mittal.nishan...@gmail.comwrote:
@ankit for removing duplicates=O(n)+O(n)
On Mon, Jul 18, 2011 at 6:36 PM, ankit sambyal
@SkRiPt KiDdIe... see my 3rd post...i've mentioned that 1st we have to
remove duplicate numbers
On Mon, Jul 18, 2011 at 6:56 PM, SkRiPt KiDdIe anuragmsi...@gmail.comwrote:
@Nishant:
1 4 5 4 5n=5
1 2 3 4 5
after xor i.e. your x1 answer contains (2^3^4^5).The missing elements
are
start from top right corner... if a[i][j] x then move left, else if
a[i][j] x then move down and if a[i][j] == x then print i and j
On Mon, Jul 18, 2011 at 11:30 PM, sivaviknesh s sivavikne...@gmail.comwrote:
-- Forwarded message --
From: sivaviknesh s
value of the static variable persists between different function call
On Mon, Jul 18, 2011 at 11:43 PM, geek forgeek geekhori...@gmail.comwrote:
int main()
{
static int var = 5;
printf(%d ,var--);
if(var)
main();
}
y output is 5 4 3 2 1
not 5 5 5 5 5 5 5 5 5
1st convert base 5 to base 10 and then base 10 to base 9
On Mon, Jul 18, 2011 at 11:54 PM, sivaviknesh s sivavikne...@gmail.comwrote:
convert a number in base 5 to base 9
--
Regards,
$iva
--
You received this message because you are subscribed to the Google Groups
Algorithm
void rev_recursion(NODE **head)
{
if(*head==NULL)
return;
NODE *first, *rest;
first=*head;
rest=first-next;
if(!rest)
return;
rev_recursion(rest);
first-next-next=first;
first-next=NULL;
*head=rest;
}
On Sun, Jul 17, 2011 at 2:53 PM, vaibhav shukla
take 2 arrays before and after... before[i] contains the product of all the
numbers before i and after[i] contains product of all the numbers after i
something like this
before[0]=1;
after[n-1]=1;
for(i=1;in;i++)
{
before[i]=a[i-1]*before[i-1];
1.while typing it must show most popular searches starting from the string
which we have typed so far
2.it must show most popular websites first
3.it must show related searches
there can be many more
On Sun, Jul 17, 2011 at 8:05 PM, swetha rahul swetharahu...@gmail.comwrote:
Write
will be O(n) this won't work for large numbers...
On Sat, Jul 16, 2011 at 1:58 AM, Nishant Mittal
mittal.nishan...@gmail.com wrote:
@sagar... I know this solution but it was strictly asked to do in O(n)
time and O(1) space complexity and what if range of numbers is very
large
value of b = 10 (in binary) and since b is a signed integer and also MSB is
1 so final value of b is 2's complement of 10 i.e. -2
On Sun, Jul 17, 2011 at 12:55 AM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
@gaurav :y it is -2?y not +2?
On Sat, Jul 16, 2011 at 2:13 PM, sukhmeet singh
delete all the numbers found in list2 from list1 recursively or iteratively
Also optimize ur algo when list1 is sorted in ascending order and list2 is
sorted in descending order
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
How will you delete duplicate odd numbers from a linked list in O(n) time
--
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
to do it in O(n)... rather not even in
O(nlogn) without modifying the list
On Fri, Jul 15, 2011 at 11:23 PM, Nishant Mittal
mittal.nishan...@gmail.com wrote:
How will you delete duplicate odd numbers from a linked list in O(n)
time
--
You received this message because you are subscribed
number of elements from both lists and reverse list with minimum
number of elements, go ahead with checking and deleting linearly
surender
On Fri, Jul 15, 2011 at 10:38 PM, Nishant Mittal
mittal.nishan...@gmail.com wrote:
delete all the numbers found in list2 from list1 recursively
How much do we have to shift if a complete match is found.
I am looking for all cases and not just disjoint occurences.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
Sorry, no need, got it
--
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/-/2KMiqR0hgx0J.
To post to this group, send email to algogeeks@googlegroups.com.
To
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Sanchit Mittal
Second Year Undergraduate
Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group
while runnin same code in .cpp format gives 1
On Thu, Jul 7, 2011 at 12:19 AM, sanchit mittal sm14it...@gmail.com wrote:
Run dis in saving the same in .C format
m getting 0...:)
#includestdio.h
#includeconio.h
struct empty{};
int main()
{
struct empty e;
int x=sizeof(e
Is there some way to find 3 elements whose sum equal to K in an array in
linear time.
Sum of 2 numbers can be done in linear time using hash in O(n) time, what if
for that case i am not allowed any extra space.
--
You received this message because you are subscribed to the Google Groups
Given two arrays of numbers, find if each of the two arrays have the same
set of ntegers ? Suggest an algo which can run faster than NlogN without
extra space?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the
== sum of 2nd array
no. of elements in 1st == no. of elements in 2nd
if the above conditions are met, they have the same set.
m i missin sth?
On Jul 3, 1:23 am, mittal mohitm.1...@gmail.com wrote:
Given two arrays of numbers, find if each of the two arrays have the
same
set of ntegers ? Suggest
segregate even and odd nodes in a singly linked list.Order of even and
odd numbers must be same...
e.g:-
i/p list is 4-1-3-6-12-8-7-NULL
o/p list 4-6-12-8-1-3-7-NULL
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
how to find kth smallest element in BST...
--
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.
plz recommend me some good sites for OS interview questions...
Thanx in advance
--
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
do inorder traversal of tree and store values in an array.
Now find pairs by applying binary search on array..
On 6/27/11, manish kapur manishkapur.n...@gmail.com wrote:
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
WAP to sort an array of character strings on the basis of last
character of each string
eg:- {xxxc , yyya, zzzb} = {yyya , zzzb, xxxc}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
space
On Mon, Jun 27, 2011 at 1:40 AM, Nishant Mittal
mittal.nishan...@gmail.com wrote:
do inorder traversal of tree and store values in an array.
Now find pairs by applying binary search on array..
On 6/27/11, manish kapur manishkapur.n...@gmail.com wrote:
--
You received
@Harshal... ur solution is nt correct.it is nt printing the
characters in order as given in i/p...
i know the solution using auxiliary array and using an extra character
array to hold the o/p string but if any1 knows inplace solution then
plz rply...
On 6/22/11, Harshal hc4...@gmail.com wrote:
It does *not* prevent deadlock so i think (D) is definitely true.
On Sun, Jun 19, 2011 at 5:15 PM, Akshata Sharma
akshatasharm...@gmail.comwrote:
Two processes, P1 and P2, need to access a critical section of code.
Consider the following synchronization construct used by the processes:
/* P1
//Prog 1
#includestdio.h
int main()
{
float a=75.7;
printf(%.10f\n,a); //prints 75.669482
if(75.7a)
printf(Hi);
else
printf(Hello);
return 0;
}
//Prog 2
#includestdio.h
int main()
{
float a=275.7;
printf(%.10f\n,a);//prints 275.7000122070 *WHY???*
if(275.7a)
printf(Hi);
else
.
In the counter example you gave, the next ptr of node 3 points to two
nodes.
So, such a case does not arise.
On Jun 3, 9:26 am, Arpit Mittal mrmittalro...@gmail.com wrote:
L1 L2
1 5
27
3
94
Is this situation
yeah ok, thanks
On Thu, Jun 2, 2011 at 11:13 PM, ankit sambyal ankitsamb...@gmail.comwrote:
I have explained what intersection means in my previous post
Ankit
On Thu, Jun 2, 2011 at 11:07 PM, Arpit Mittal mrmittalro...@gmail.com
wrote:
@naveen ,ross and ankit -
I know
Please help me in this question.
What's the condition so that the following code prints both HelloWorld !
if condition
printf (Hello);
else
printf(World);
--
-Arpit Mittal
6th Semester,
Indian Institute of Information Technology,Allahabad
Email : arpitmittal.ii
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.
--
-Arpit Mittal
6th Semester,
Indian Institute of Information Technology,Allahabad
Email : arpitmittal.ii...@gmail.com
.
--
-Arpit Mittal
6th Semester,
Indian Institute of Information Technology,Allahabad
Email : arpitmittal.ii...@gmail.com
rit2008...@iiita.ac.in
Contact : +91-8853049787
Let every man be respected as an individual and no man idolized.
--
You received this message because you are subscribed
@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.
--
-Arpit Mittal
6th Semester,
Indian Institute of Information Technology,Allahabad
Email : arpitmittal.ii
could you please explain how?
On Fri, May 27, 2011 at 3:45 AM, varun pahwa varunpahwa2...@gmail.comwrote:
i think 11.
On Fri, May 27, 2011 at 3:06 PM, Arpit Mittal mrmittalro...@gmail.comwrote:
8?
On Fri, May 27, 2011 at 2:26 AM, anil chopra
anil.chopra2...@gmail.comwrote:
11
options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
-Arpit Mittal
6th Semester,
Indian Institute of Information Technology,Allahabad
Email : arpitmittal.ii...@gmail.com
rit2008...@iiita.ac.in
Contact : +91-8853049787
Let every man be respected
@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.
--
-Arpit Mittal
6th Semester,
Indian Institute of Information Technology,Allahabad
Email : arpitmittal.ii
.
But not below 11 its entry to semi will depend on other team
performance.
On May 27, 7:11 pm, Arpit Mittal mrmittalro...@gmail.com wrote:
@rishabh :
in your solution u have taken scores of last 4 teams as 6 4 2 0. what if
i
take 2 2 2 2 then the ans would be 56-(2+2+2+2)/4 = 12...!!!
and i
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
-Arpit Mittal
6th Semester,
Indian Institute of Information Technology,Allahabad
Email : arpitmittal.ii...@gmail.com
rit2008...@iiita.ac.in
Contact : +91-8853049787
Let every man
!!!
I hope it is clear.
On May 27, 7:27 pm, Arpit Mittal mrmittalro...@gmail.com wrote:
@Vishwakarma
it is now ok that 11 should be the answer, but why any 4 teams cannot
win 12
matches in total...
for that they have to score 12*4 = 48 points out of 56. then wats
email dis buk to me too... sm14it...@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
/group/algogeeks?hl=en.
--
-Arpit Mittal
6th Semester,
Indian Institute of Information Technology,Allahabad
Email : arpitmittal.ii...@gmail.com
rit2008...@iiita.ac.in
Contact : +91-8853049787
Let every man be respected as an individual and no man idolized.
--
You received this message
gtcha:)
--
Sanchit Mittal
Second Year Undergraduate
Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
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
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Sanchit Mittal
Second Year Undergraduate
Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received this message because you are subscribed to the Google Groups
am not pretty sure how malloc or
new
arrays can speed up execution?
On Mon, Mar 21, 2011 at 2:25 PM, sanchit mittal sm14it...@gmail.com
wrote:
use scanf n printf instead of cin n cout,
malloc array of structures after reading value of n if working in c else
use new in cpp
rest i
; j N; j += 2 * i ) mark [j] = false;
}
}
mark[i]=true ,, i represents prime no.
--
Sanchit Mittal
Second Year Undergraduate
Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received this message because you are subscribed to the Google Groups
Algorithm
PM, sanchit mittal sm14it...@gmail.com
wrote:
use scanf n printf instead of cin n cout,
malloc array of structures after reading value of n if working in c
else
use new in cpp
rest i guess...is ok
On Sun, Mar 20, 2011 at 11:53 PM, ankit sambyal
ankitsamb...@gmail.com
time array once for each elapse
time calculations ie O(n) and O(n^2) in total. I am not able to figure out
a faster method or a DP approach. Suggestions awaited
On Mon, Mar 21, 2011 at 11:20 PM, sanchit mittal sm14it...@gmail.comwrote:
with so many nested loops u r obvcly goin to get tle
.
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.
--
Sanchit Mittal
Second Year Undergraduate
Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You
can anyone help me with NZEC errorwhat it is ,how to find and
remove it
--
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
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Sanchit Mittal
Second Year Undergraduate
Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received this message because you are subscribed
search on google for unetbootin.
this will help you to create a bootable pen drive from the iso file for any
linux distribution.
Mohit Mittal
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
Somehelp with (a/b)modm expression.
http://en.wikipedia.org/wiki/Modular_arithmetic
i visited this link but found only for addition,subtraction and
multiplication.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Thats my problem.
that i am not use mod operator in between
and i am not able to store that large value in a variable so that i can
take it mod with 107 later.
this for what i want a suggestion how to get mod in bw or is there some
other way i can approach.
Well this is for problem
https://www.spoj.pl/problems/AMR10A/
Logic :
Cannot find the area on the fly for all Q
- Precompute the area of all polygons with a segment joining
0 and x as end points.
- We can do this by using area of [0,x-1] and area of triangle
[0,x-1,x]
I have implemented this but i am not able to find
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Sanchit Mittal
Second Year Undergraduate
Department of Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Sanchit Mittal
Department of Computer Engineering
Delhi College
i dont know how shud i modify my code using epsilon shall i mail it to
someone or straightaway post it here .?
On Sun, Jan 2, 2011 at 9:58 PM, sanchit mittal sm14it...@gmail.com wrote:
i was doin a check on which one of the two floats is greater using sign
but was unable to do soi m
...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Sanchit Mittal
Second Year Undergraduate
Department of Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received this message because
.
--
Sanchit Mittal
Second Year Undergraduate
Department of Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com
);
}
return 0;
}
--
Sanchit Mittal
Second Year Undergraduate
Department of Computer Engineering
Delhi College of Engineering
ph- +919582414494
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge
how to use hash table
i have a pair (a,b) with which i want to use.
if i use hash function like a+nb there will be number of clashes.
also , i have tried map stl in some of programs and most of them give
TLE.
So, is there a better way for this or i have to look a different
approach to this.
its like i have two number a and b both can have max value 10^6.
i have to store a value for the pair (a,b)
i also want to access in O(1) time.
On Dec 19, 5:41 pm, juver++ avpostni...@gmail.com wrote:
How many elements you would have at all?
--
You received this message because you are
can anyone explain me how exactly servlet object is created
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
hello friends.
plz suggest some new ideas for java projects for IT 4th year
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send
first player can check if sum of notes placed in the odd position are
greater than the sum of notes placed in the even position and can pick
accordingly and will always win.
On Sat, Oct 9, 2010 at 10:52 AM, Anand anandut2...@gmail.com wrote:
Yes.
http://codepad.org/2KFrv8cs
On Fri, Oct 8,
thanks buddy.
On Tue, Sep 14, 2010 at 9:41 AM, sharad kumar aryansmit3...@gmail.comwrote:
teach ur self sql in 24 hrs. or use oracle complete guide.the fat book
On Tue, Sep 14, 2010 at 6:50 AM, Ayush Mittal
ayushmittal2...@gmail.comwrote:
can anybody tell me how to command
what is the command to clear screen in mysql..?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
whats this...?
On Tue, Sep 14, 2010 at 12:07 PM, Rohit Saraf
rohit.kumar.sa...@gmail.comwrote:
See it here : jfgi http://www.urbandictionary.com/define.php?term=jfgi
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
thanks man bt i hve searched a lot bt couln't find it...if u could
help me plz...?
On Tue, Sep 14, 2010 at 4:27 PM, Rohit Saraf rohit.kumar.sa...@gmail.comwrote:
well i just wanted u to know that there is a very nice place called
www.google,com where u can find many things.
--
1 - 100 of 126 matches
Mail list logo
