:)
--
Nice Day
Abhishek Sharma
Bachelor of Technology
IIT Kanpur (2009)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com
@Tian tanx
On Tue, Jul 9, 2013 at 5:55 PM, abhishek sharma abhishek.p...@gmail.comwrote:
Okay let me explain my approach -
1. Read numbers from the input stream and create an array of lists.. i
started with hashmaps and hashsets etc .. but they greatly killed
performance
2. Each index
free to contact me .. always online..
On Tue, Jul 9, 2013 at 5:32 PM, Tian Guo tian@epfl.ch wrote:
Can you just briefly describe your algorithm and time complexity? Then we
could know the problem and think about from which perspective to improve it.
Thx!
2013/7/9 abhishek sharma
Here is the link to problem - http://www.codechef.com/problems/COUNTARI
You can see my many unsuccessful attempts in All Submissions..
Ppl with successful submission have used a superb way to just use arrays to
solve this.. I hate those einsteins!
On Tue, Jul 9, 2013 at 5:56 PM, abhishek
Are these openings for present final year students(2013 batch) as well???
regards
Abhishek
On Tuesday, 15 January 2013 16:47:01 UTC+5:30, sahil madaan wrote:
Hi all,
There are multiple openings for SDE1 and SDE2 for Amazon hyderabad and
Bangalore location. Interested candidates please send
.
Can anyone give better algo for this.
On Sat, Dec 29, 2012 at 3:07 AM, Abhishek Jha abbi031...@gmail.comwrote:
Google skyline problem and you will find results for solving it with heap
On Sat, Dec 29, 2012 at 1:49 AM, shady sinv...@gmail.com wrote:
How to extract the skyline from
Google skyline problem and you will find results for solving it with heap
On Sat, Dec 29, 2012 at 1:49 AM, shady sinv...@gmail.com wrote:
How to extract the skyline from the rectangles ?
Given a set of rectangles with x coordinates and height, how to find the
skyline ?
--
--
yep its right.one mre method will be
a=a+b;
b=a-b;
a=a-b;
On Mon, Nov 5, 2012 at 2:02 AM, manish narayan.shiv...@gmail.com wrote:
Swapping two objects (not integers/chars),without using temp...?
my solution is using xor operation..is that right and ny other solutions ?
--
You
Have u tried BIT Approach
On Mon, Oct 22, 2012 at 1:40 AM, Aamir Khan syst3m.w...@gmail.com wrote:
What is the best algorithm to print all the inversions in an array? While
you can find the inversion count using modified merge sort procedure in
O(nlog(n)) time [1] but I doubt that
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Patro
--
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 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.
--
Abhishek Patro
--
You received this message because you
http://iamcodebug.wordpress.com/category/interview-question/accolite-interview-question/
On Sat, Sep 8, 2012 at 7:22 PM, mitaksh gupta mitak...@gmail.com wrote:
Hey Varun,
can you elaborate about the interview process a bit more.. like how many
rounds are there.. and what to expect in each
I appeared for snapdeal's exam on 27th.The question paper had 2
sections:aptitude and programming
In aptitiude,there were questions like
1) find time after 2pm, where two hands of clock intersect
2)find max of two numbers without using if,else or comparison operators
3)3 ants on vertices of
50 questions were there in written test ( aptitude (22), c, c++, signals,
networking, 8085, 8086)
I got 35/ 50 in written test.
In interviews, they asked questions like what is polymorphism, reverse a
linked list, explain quicksort etc.
On Mon, Aug 27, 2012 at 8:40 AM, apoorv gupta
, Abhishek Kumar abhivai...@gmail.comwrote:
two coding Qs + some mcqs(more than 1 option correct),time is 1.5 hr..
On Fri, Aug 10, 2012 at 4:06 PM, deepikaanand swinyanand...@gmail.comwrote:
Somebody from DCE plz tell the paper pattern of google...
--
You received this message because you
smbody plz post cisco written Qs
On Thu, Aug 9, 2012 at 12:29 PM, Abhi abhi120@gmail.com wrote:
Hi Guys,I have Cisco Goldman Sachs placement exams next week.
If anyone has appeared for cisco or Goldman Sachs recentlyplz post
some of the questions asked by them.
It would really be of
two coding Qs + some mcqs(more than 1 option correct),time is 1.5 hr..
On Fri, Aug 10, 2012 at 4:06 PM, deepikaanand swinyanand...@gmail.comwrote:
Somebody from DCE plz tell the paper pattern of google...
--
You received this message because you are subscribed to the Google Groups
Algorithm
http://courses.csail.mit.edu/6.006/spring11/lectures/lec02.pdf
On Mon, Aug 6, 2012 at 12:19 AM, dheeraj chawla dheeraj.chawla...@gmail.com
wrote:
hello guys, check this code n tell me if i m worng
int localminima(int a[],int start,int end)
{int mid;
while(startend)
{
please mail me too. Directi is coming for written test on this 8th in our
college.
Thanks in advance..
On Tue, Jul 31, 2012 at 11:48 PM, amit singh amitsingh...@gmail.com wrote:
hi shaukat Ali ,it will be really kind if you can forward me that paper
of directi
my ID:amitsingh...@gmail.com
.
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.
--
Abhishek Sharma
Under-Graduate Student,
PEC
/msg/algogeeks/-/lZKI47459WgJ.
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.
--
Abhishek Sharma
, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
@Raj: trace karke dekh na yaar when u have 3 0s and 3 6s.. the sum
distribution would look like this:
given below are the possibilities:
Combination of 1,2,3,4,5,6 with 0
1+0 = 1
2+0 = 2
3+0 = 3
OR
4+0 = 4
5+0 = 5
6+0 = 6
Combination of 1,2,3,4,5,6 with 6
1+6 = 7
2+6 = 8
3+6 = 9
OR
4+6
options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
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.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because you are subscribed to the Google Groups
Algorithm
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.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received
and flag = 1
fetch last word (temp string)
On Wed, Jul 4, 2012 at 10:51 PM, Abhishek Sharma abhi120...@gmail.comwrote:
Fetch a character.
if isdigit( current_character )
flag =1
else if current_character is any character except space
while current_char is not space
+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
3 - 4 - 5, sorry for that silly mistakes
On Wed, Jul 4, 2012 at 10:54 PM, Abhishek Sharma abhi120...@gmail.comwrote:
it was 4 - 5, not 4 - 5 - 6
On Wed, Jul 4, 2012 at 10:41 PM, Abhi abhi120...@gmail.com wrote:
Any efficient algorithm to find intersection of two linked lists.Example
/-/Pr2cEtta_LsJ.
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.
--
Abhishek Sharma
Under-Graduate Student
what s silly mistake. @Rahul thanks for correcting me.
On Tue, Jul 3, 2012 at 3:41 PM, rahul ranjan rahul.ranjan...@gmail.comwrote:
@abhishek its wrong as arr1 is just a pointer o int and sizeof(arr1)
will always be 4 bytes(size of a pointer) regardless of number of bytes
allocated
=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
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
naa noone can tell you.. haha.. just kidding...
for OS refer the prescribed text. I studied from Silberschatz, Galvin,
Gagne: *Operating System Concepts.. *
amazing book.. just understand the basics.. like process shceduling
algorithms, page shceduling algorithms, threads, context switching,
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.
--
Abhishek Sharma
Under
options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because you
at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
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
we can handle exception handling through macro.
http://en.wikibooks.org/wiki/C_Programming/Error_handling
On Tue, Jun 12, 2012 at 9:47 PM, Anika Jain anika.jai...@gmail.com wrote:
how can we implement exception handling in c?
--
Regards
Anika Jain
--
You received this message because
, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because you are subscribed to the Google Groups
false
On Fri, Jun 8, 2012 at 11:49 AM, Abhishek Sharma abhi120...@gmail.comwrote:
You don't need to use BigNum or long int for this program.
Both n k should be less than 1000.
Since there is no restriction on k,you don't need Bignum
Since both n,k are restricted,you don't need bignum.
if n5
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Abhishek Prajapati
Final Year, B.Tech(Hons)
Department of Computer Science Engg.
NIT Jamshedpur*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks 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.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You
@prem, i don't get it.could you please elaborate the interesting part of
this solution ?
On Thu, Jun 7, 2012 at 11:39 AM, Abhishek Sharma abhi120...@gmail.comwrote:
Is there any online compiler which gives output for both little/big endian
machines ?
or it is fine to convert value from one
bits become 0010 (2 in decimal), last 8 bits remain same.
Am i right ?
On Thu, Jun 7, 2012 at 12:53 PM, Abhishek Sharma abhi120...@gmail.comwrote:
@prem, i don't get it.could you please elaborate the interesting part of
this solution ?
On Thu, Jun 7, 2012 at 11:39 AM, Abhishek Sharma
.
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.
--
Abhishek Sharma
Under-Graduate Student,
PEC
---
Abhishek Sharma wants to stay in better touch using some of Google's coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-f2b6967bf6-d78b18cba1-gqPKMkil32YfIMUTyJpM7kfmucY
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
, 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.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
can anyone please tell me how important are heaps as compared to other data
structures (from interview's point of view). i am not talking about simple
min/max heaps, but advanced ones like fibonacci heaps and binomial heaps
--
You received this message because you are subscribed to the Google
how to implement dijkstra algorithm using fibonacci heaps ?thanks 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
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.
--
Abhishek Sharma
Under-Graduate Student,
PEC
This code have issue.
names[3]=names[4];
names[4]=t;
-Original Message-
From: algogeeks@googlegroups.com [mailto:algogeeks@googlegroups.com] On
Behalf Of mahendra sengar
Sent: Monday, June 04, 2012 4:13 AM
To: Algorithm Geeks
Cc: sengar.m...@gmail.com
Subject: [algogeeks] Simple Question
@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.
--
Abhishek Sharma
Under-Graduate Student,
PEC University of Technology
--
You received this message because
Hi,
I have found two url which contain answer of your question some extent.
42bits.wordpress.com/2010/04/17/find-kth-minimum-in-a-unsorted-array/
http://www.medwelljournals.com/fulltext/?doi=rjasci.2011.70.75
On Sun, Jun 3, 2012 at 8:31 PM, abhinav gupta abhinav@gmail.com wrote:
Hi Rahul,
In the below url,They have mentioned the parallel searching. it means
divide array than search element from two point.
i.e number of element is {48,23,10,32,5} search 32.
divide array [0-2] and [3-4] range... traverse the array from p[0] and p
[3]... till half of the loop.
I hope
@prem: can you please explain the approach clearly, I did't get the
approach.
regards
Abhishek
On May 23, 7:43 pm, Doom duman...@gmail.com wrote:
I am trying to understand the question.. please let me know the answer for
the following cases..
case1:
test
testlong
testlongtest
do you handle the case for negative numbers??
What I think we can do is:
If we take ia and ib as BigInteger in Java then we don't have that
constraint of 32 bits. I tried it out it works for large no as 35000
instantly.
But that still doesn't solve the problem of -ve numbers.
regards
Abhishek
http://www.geeksforgeeks.org/archives/767 just look into url
-Original Message-
From: algogeeks@googlegroups.com [mailto:algogeeks@googlegroups.com] On
Behalf Of Sairam Ravu
Sent: Monday, May 07, 2012 12:59 PM
To: algogeeks@googlegroups.com
Subject: Re: [algogeeks] Permutations of a
?hl=en.
--
Abhishek Kumar
B.Tech(IT) Graduate
Allahabad
Contact no-+919663082731
--
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
,
6xxx, 007asdf,
00042Q, 42s,
6 8, 006 9,
};
int i;
for (i = 0; i sizeof s / sizeof s[0]; i += 2) {
int cmp = compare(s[i], s[i + 1]);
printf(%s %c %s\n, s[i], =?[cmp + 1], s[i + 1]);
}
return 0;
}
On Apr 17, 11:46 pm, abhishek zeal.gosw...@gmail.com wrote:
Hi
@Bhupendra: your approach is correct but in case the linked lists contain
millions of nodes then this might be an overhead.
Another approach could be:
- Start with the head of of both the lists.
- Store (Hash) the addresses to which the current nodes are pointing to, in
a hashtable.
- while
i;
for (i = 0; i sizeof s / sizeof s[0]; i += 2) {
int cmp = compare(s[i], s[i + 1]);
printf(%s %c %s\n, s[i], =?[cmp + 1], s[i + 1]);
}
return 0;
}
On Apr 17, 11:46 pm, abhishek zeal.gosw...@gmail.com wrote:
Hi,
I need to compare string into following way. Can anyone
Hi,
I need to compare string into following way. Can anyone provide me some
insight or algorithm in c++.
For example:
a5 a11- because 5 is less than 11
6xxx 007asdf- because 6 7
00042Q 42s - because Q s alphabetically
6 8 006 9 - because 8 9
Hi,
I need to compare string into following way. Can anyone provide me some
insight or algorithm in c++.
For example:
a5 a11- because 5 is less than 11
6xxx 007asdf- because 6 7
00042Q 42s - because Q s alphabetically
6 8 006 9 - because 8 9
@Atul: after u sort the list the head pointer will automatically point to
the smallest element so u actually return the head of the list.
@Sambhavna:
here is the Pseudoccode (More or less similar to, doing merge sort for
arrays):
Mersgesort(node ** list){
if( head==NULL or head- next ==
It is basically sorting the linked list. Do not change the first pointer of
nodes and use the second pointer for sorting. return the pointer to the
smallest element. That's it.
On Sat, Mar 24, 2012 at 12:50 AM, Atul Singh atulsingh7...@gmail.comwrote:
Given a linked list with each node having
@don: inplace Mergesort can be used. Complexity would be O(nlogn).
@Ashish: Heapsort is reliable but unstable and also, slower.
On Sat, Mar 24, 2012 at 1:49 AM, Don dondod...@gmail.com wrote:
A merge sort will be O(n*log n) and not use the extra memory required
for a heap.
Don
On Mar 23,
http://viralpatel.net/blogs/2009/01/how-to-take-screen-shots-in-java-taking-screenshots-java.html
On Fri, Feb 3, 2012 at 8:35 AM, Arun Vishwanathan aaron.nar...@gmail.comwrote:
Hi,
does anybody know how to take a screenshot of screen with java ?
I also need help regarding storing the
Hi,
Could any point out me any algorithm and program if we need to sort to
large data
like 10 ^ 80 with memory constraint. Suppose you have minimum memory like 4
MB.
I am not sure that this algo discussed or not but i was not able to find in
this group.
Thanks
Abhishek
--
You received
@DAVE
hmm I am agree with you that we will not have that much huge
data. This question came in my interview process and I was not able to
figure out the solution of this issue.So I thought to check this forum
On Sun, Jan 15, 2012 at 12:40 AM, Dave dave_and_da...@juno.com wrote:
@Abhishek: Do
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Thanks Regards
Abhishek Gupta
BITS, Pilani
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
--
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, visit this group at
Cool Rahul
On Sat, Dec 17, 2011 at 3:09 PM, Rahul raikra...@gmail.com wrote:
Google this
6.046
You should not ask any more suggestion till you complete the above
On Sat, Dec 17, 2011 at 3:07 PM, Abhishek Goswami
zeal.gosw...@gmail.comwrote:
--
You received this message because
ya Sure Thx bro
On Sat, Dec 17, 2011 at 3:15 PM, Rahul raikra...@gmail.com wrote:
If you have time then Do a Google this
www.algo-class.org
On Sat, Dec 17, 2011 at 3:13 PM, Abhishek Goswami
zeal.gosw...@gmail.comwrote:
Cool Rahul
On Sat, Dec 17, 2011 at 3:09 PM, Rahul raikra
is
needed.
--
Abhishek Kumar
B.Tech(IT) Graduate
Allahabad
Contact no-+919663082731
--
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
email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Regards
*Abhishek*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Represent the dependencies as a graph. Store all the values in a list. For
each vertex in the graph find all values for which there is no edge from
the vertex. If these values are there in the list, remove them from the
list and create a set of the vertex and the removed values.
If the values are
@Ankur
In a trie u first insert the first word ..take the second word..If its
not
present in the trie u insert it else remove it from original string:
removing the word requires left shifting the entire string
Alternatively u store the elements in a trie in the initial string and
terminate it
@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.
--
Nice Day
Abhishek Sharma
Bachelor of Technology
IIT Kanpur (2009)
--
You received this message
Can in place compaction be done without left shifts?
--
Nice Day
Abhishek Sharma
Bachelor of Technology
IIT Kanpur (2009)
--
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
Do you think we require two group. it will be good if we post all
query in one group. it is up to people who want to read or reply the
mail
On Oct 7, 12:25 am, arvind kumar arvindk...@gmail.com wrote:
great idea..totally agreed! :)
On 10/7/11, shady sinv...@gmail.com wrote:
no, just two
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.
--
Nice Day
Abhishek Sharma
Bachelor
.
--
Nice Day
Abhishek Sharma
Bachelor of Technology
IIT Kanpur (2009)
--
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
.
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.
--
Thanks Regards
Abhishek Iyer
If You Obey All the Rules, You Will Miss All the Fun.
--
You received this message
a file is given containing lots of records seprated by new line
(records can be repeat)
and a substring given for egabc
now check for the record which contains the substring
and print top 10 record according to their frequency
derive algo with complexity o(n)
On Sep 26, 10:58 am, htross
@ shady i appreciate you
but can't resist myself as i barely need it
so plz mail me as well
On Sep 26, 4:25 pm, shady sinv...@gmail.com wrote:
if someone is having the book, he/she will not specifically mail it to each
and everyone of you... rather to the mailing list.. so stop sending these
c,c++ ,java
On Sep 26, 4:15 pm, Akash Mukherjee akash...@gmail.com wrote:
any language pref?? are bash solns acceptable??
On Mon, Sep 26, 2011 at 12:04 PM, abhishek abhishek.ma...@gmail.com wrote:
a file is given containing lots of records seprated by new line
(records can be repeat
here is the process of paypal/ebay india
written test ---40 ques in 60 min (no negative marking)
interview 1
interview 2
HR interview
written was a mix of technical and aptitude question
interview 1
first asked me about my hobby and discussed about 5 to 10 min on it
discussed on project
asked
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.
--
Thanks Regards
Abhishek Gupta
--
You received this message because you
process was
written test
technical interview 1
tech interview 2
coading round
disscussion /improvement in coading
On Sep 26, 9:08 am, aditya kumar aditya.kumar130...@gmail.com wrote:
I cleared the written round, the next round was coding round.
We were asked to select any one problem out of
congrats dude
hope u will be well connected with this group and help others to
achieve their goals
On Sep 22, 8:29 am, saurabh sah.saurab...@gmail.com wrote:
I sincerely thank this group as i got selected in Microsoft IDC only
because
of this group .
It was a wonderful experience for me at
I have seen code and output but I think it should be 7965 am i right? if you
are looking for first largest
On Thu, Sep 22, 2011 at 12:46 AM, Anil Arya anilarya...@gmail.com wrote:
http://ideone.com/pmil8
On Thu, Sep 22, 2011 at 12:46 AM, Anil Arya anilarya...@gmail.com wrote:
@kartik
Is
You have given a number 123456789 and two opearators + and *. You can
use this two operators as many times u want. But you cant change the
sequence of the number given there. The evaluated value is 2097.
e.g. 1+2+345*6+7+8+9=2097
You have to find all the such expressions that evaluates and
DCE
i am also want to know recruitment process as it is coming on 23rd.
On Sep 21, 7:52 pm, Simran Singh sammy.4...@gmail.com wrote:
Hey.. Which college you from..?? And please do tell more about their
process..
On Wed, Sep 21, 2011 at 7:31 PM, abhishek abhishek.ma...@gmail.com wrote
Guys
what is the difference between ftell(fp)1 and ftell(fp) 0??
...
Abhishek Gupta
--
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
output is
18 9 0
0
0
8
the same was expected.
printf uses stack when it has multiple arguments to print
On Sep 18, 1:19 pm, Bhavesh agrawal agr.bhav...@gmail.com wrote:
another que..
#includestdio.h
main()
{
int a;
int i=10;
printf(%d %d %d\n,i+++i,i,i---i);
@ sukran
if it is giving same ans then there has to be some reason,
On Sep 19, 12:45 pm, sukran dhawan sukrandha...@gmail.com wrote:
common guys its undefined acc to standard c
On Mon, Sep 19, 2011 at 12:36 PM, Siddhartha Banerjee
thefourrup...@gmail.com wrote:
on
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.
--
Nice Day
Abhishek Sharma
Bachelor of Technology
IIT Kanpur (2009)
--
You received
1 - 100 of 276 matches
Mail list logo
