:)
--
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
sharma abhishek.p...@gmail.comwrote:
@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
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
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
to it on heap
On Tue, Jul 3, 2012 at 3:14 PM, Abhishek Sharma abhi120...@gmail.comwrote:
arr1 = (int *)malloc(sizeof(int) * ncols);// memory allocated for 1st
row
arr2 = (int **)malloc(sizeof(arr1) * nrows);
I haven't tried it.So,please correct me if i am wrong
On Mon, Jul 2, 2012
=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
, 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
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
@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
@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
@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,
@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
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 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
for your question -
On Sun, Sep 18, 2011 at 3:44 PM, abhishek sharma abhishek.p...@gmail.comwrote:
hi prasanth,
i was asked a similar ques but with the condition that path shud terminate
at a leaf node u just have to return true if you are able to find a path.
what i did was,
- do
similar to CAT though the level is little low... no technical questions are
asked..
On Wed, Aug 24, 2011 at 11:50 PM, Akanksha . akanksha...@gmail.com wrote:
It is a general aptitude test.. they ask u ques on quant, verbel n
problems solving skills.. prepare well if u r planning to take this
exit() calls clean up codes (flushing the buffer etc) while _exit() does
not..
FYI- pls use google for such questions.
Regards,
Abhishek
On Thu, Aug 18, 2011 at 3:26 PM, Amol Sharma amolsharm...@gmail.com wrote:
anyone ??
--
Amol Sharma
Third Year Student
Computer Science and
M (hint: replace ü and û with their actual meaning.. u 'll understand)
On Fri, Aug 19, 2011 at 4:10 AM, payal gupta gpt.pa...@gmail.com wrote:
was there anything more specified
Regards,
PAYAL GUPTA
On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani
virmanisadi...@gmail.comwrote:
scan the array from both the ends..i.e use two pointers to scan the array..
left pointer points at the beginning and right one one at the end..
left pointer can be used to find whether an element is even or not until it
reaches end while right pointer can be used to find whthr a no is odd until
it
small change in the pseudocode..
for (i=0 until i+ a[].length){
if (*leftptr % 2 == 0)
A2[i] = *leftptr ;
else if (*rtptr % 2 == 0)
A2[i+a[].length-1] = *rtptr ;
leftptr++;
rtptr--;
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
x-y = add(x, add(~y, 1))
here add(~y,1) refers to the Two's complement of y...
On 7/12/11, Anika Jain anika.jai...@gmail.com wrote:
how to do subtraction of two integers widout using subtractn??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
@rahul: buddy, u can ignore the mail if u don't want to answer (no offense).
Lets not discourage someone from asking questions...
On Tue, Jun 21, 2011 at 11:23 PM, rahul rahulr...@gmail.com wrote:
If u want us to solve the GATE paper, please attach the paper, we will post
the solution.
Our all candidates of batch Sept 10 - Jan 11 got placed in top MNC companies
with very lucrative salary like earlier batches. Most of the candidates had
multiple job offers with min Rs. 15000/- in hand per month salary. Jan 11 -
May 11 batch placement is running and almost 50% students has
@sourabh: could u please elaborate how u came to that conclusion.
Dave's logic seems to be right..
On Thu, Mar 31, 2011 at 11:00 AM, sourabh jakhar sourabhjak...@gmail.comwrote:
answer is 6 races
On Mon, Mar 28, 2011 at 11:53 PM, Dave dave_and_da...@juno.com wrote:
7 races.
For the
@Carl: the one at the bottom works..
On Fri, Apr 1, 2011 at 1:17 AM, hary rathor harry.rat...@gmail.com wrote:
everybody want to be mark.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
*@Shady:* buddy lets not discourage som1 interested in learning :) this is
the purpose of this group..
*
@harry:* as some1 has said: there is no shortcut to success.. first go
through any good Datastructures/algorithms book.. try to code those
algorithms on ur own..once u feel u r comfortable with
thanks a ton for the info... we didnt know about that :P...
btw for ur info.. we are not supposed to use loops as well..
On Fri, Mar 11, 2011 at 7:10 PM, Abhishek Mallick
abhishek.mallick2...@gmail.com wrote:
#include stdio.h
int main()
{
while(printf(Hello));
return 0;
}
On Thu, Mar
@nidhi: yup.. u r rite.. sorry..my bad...
On Thu, Mar 10, 2011 at 11:58 AM, Nishant Agarwal
nishant.agarwa...@gmail.com wrote:
#includestdio.h
void print1();
void print2()
{
printf(Hello\n);
print1();
}
void print1()
{
printf(Hello\n);
print2();
}
int main()
{
#include headers
int main(){
printf(Hello);
main();
}
On Mon, Mar 7, 2011 at 7:38 AM, Terence technic@gmail.com wrote:
system(yes Hello);
(on Linux)
On 2011-3-7 2:09, sudheer kumar wrote:
use GOTO
On Sun, Mar 6, 2011 at 10:49 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote:
How
intermittently in
the background doing the garbage collection operation for the java runtime
system
On Tue, Mar 8, 2011 at 9:16 PM, Abhishek Sharma jkabhishe...@gmail.comwrote:
what do u mean by multi-threading :P
On Tue, Mar 8, 2011 at 7:37 PM, vaibhav agrawal agrvaib...@gmail.comwrote:
Hi
beetle :P
On Tue, Mar 1, 2011 at 2:01 PM, Ankur pratik ankurocks...@gmail.com wrote:
beetle
--
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,
This is simple..
Find the values for f(n) for n=1,2,3,4,... n-1 which are 0, 1, 2, 3, ... n-2
respectively. (Solve the equation for n=2,3, etc to get the values).
From the pattern you can easily find out that f(n+1)= n.
On Wed, Feb 16, 2011 at 9:15 PM, Vikas Kumar dev.vika...@gmail.com wrote:
dude... Practice is the only solution to ur problem...
U can try any one of the following: topcoder, spoj, (already mentioned in
the thread) codechef etc...
U can also refer to previous posts in this group and try to code those
problems on your own and then refer to the solutions to check where
Programming Interviews Exposed is a good one..
On Tue, Jan 18, 2011 at 9:27 PM, Yellow Sapphire pukhraj7...@gmail.comwrote:
Hi,
Can someone suggest good books/websites/blogs for interview related
questions.
thanks--
YS
--
You received this message because you are subscribed to the
You are given a set of phrases (let us call them keywords), each of
1-4 words. Group the keywords into clusters (groups of keywords) by
picking keywords which are similar to each other.
There are multiple ways to cluster(group) them
1) using single keyword as the cluster name. Eg cluster name
@Anand:
Let me know your input we can modify it accordingly.
I have already mentioned it in previous posts.. for your sake I ll do it
again..
Input is a a map of a small area..(some college campus)..it can be in the
form of an image, osm format (www.openstreetmap.org) or in the kml format (
@Anand: good one
On Sat, Jul 3, 2010 at 2:02 AM, Anand anandut2...@gmail.com wrote:
This is an example of bitonic sequence if we reverse the bottom half of the
array.
Sequence is called Bitonics if the sequence of number first
increases(ascending order) and then decrease(descending order).
I think its similar to the merge operation which is used in merge sort...
correct me if I am wrong..
Regards,
Abhishek
On Sat, Jul 3, 2010 at 12:00 AM, ANKUR BHARDWAJ ankibha...@gmail.comwrote:
Given an array of n elements and an integer k where kn. Elemnts
{a[0].a[k] and a[k+1].a[n]
@senthil: thanks for the interest.. I did that purposely..(just wanted to
see if any1 is interested or not).. here are the details...
I have a map..of a small area (say a college campus).. in OSM(openstreetmap)
format or it could also be in kml (google map) format..
Now the application is
@sharad: if you find the subarrays of equal sum then the number of players
might differ in the team... also can you tell me how will you do
that..according to me time cmoplexity will be higher..
According to me:
sort the palyers based on skill points (O(nlogn) --mergesort) then assign
the players
Correction: Team2:7, 10, 11, 12, 15
On Sun, May 30, 2010 at 11:45 PM, Abhishek Sharma jkabhishe...@gmail.comwrote:
@sharad: if you find the subarrays of equal sum then the number of players
might differ in the team... also can you tell me how will you do
that..according to me time
77 matches
Mail list logo
