Find the Largest Element in the Array and create an array of that size.
now scan the given array and increment the corresponding index of the new
array
search for the largest number in the new array and the corresponding index
is the number that is repeated most number of times.
On Thursday,
Hello everyone,
I was trying to implement Trie in c++ for the first time and got some
issues in coding its implementation.
The code has 2 commented lines namely cmnt1 and cmnt 2.
I dont understand how does it make a difference if i use cmnt1 instead of
cmnt2 .
Both lines are intended to check if a
@Sachin :thanks man i just tried to change the code with focus on
initializing NULL values to child pointers array (TrieNode-symbol in this
case) and it just works fine.
@Atul : thank you for trying to run the code. Actually the IDE i use
preferably is DEV-c++ which had the problem i
Hello everybody,
I need to find a way of finding the longest palindrome in a very very long
string (n=2) . a linear time algo is expected. help me out
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web
@rahul: excellent answer. thanks a ton!!.
@navin :i will try that too .Thanks !!
--
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
If there are total 5 tyres, including the 4 attached ones...
you can change do a rotation, change tyre after every 2000 kms( or the
factors of 2000), in that case, the journey by each one would be 8000.
i think there can be several interpretations of the qn. IF for five extra
tyres, wud mean equal
Respected Sir/Madam,
In the problem www.spoj.pl/problems/AMR11A
I have used the following recursion :
Definitions :
S[i][j]=stores the maximum minimized value that the sum attains starting
from i,j and ending at R-1,C-1 ;
a(i)(j)=(i,j) th element of given array
I applied the following
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.
--
Aditya Gupta
B.Tech III
://groups.google.com/group/algogeeks?hl=en.
--
Aditya Gupta
B.Tech III yr CSE
IITR
--
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.
--
Aditya Gupta
B.Tech III yr CSE
IITR
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group
for 16bit ..take a number n = 1000
let x be the number mentionf in a question
pos = -1
while (1){
if(x n){
pos++
exit}
else
n »=1
}
pos is the answer
if pos is greater than numbr of bits then x doesnt hv set bits
How to find the LEFT MOST set bit in an unsigned integer.
Example:
me as well, it is quite awkward now, pls look into it.
On Feb 2, 12:33 am, arpit.gupta arpitg1...@gmail.com wrote:
HI,
i am not recieving any mails since 20 jan , plz chk
thank you
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
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.
--
Regards
Aditya Kumar
B-tech IV year
Computer Science Engg.
MNNIT, Allahabad
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Regards
Aditya Kumar
B-tech IV year
Computer Science Engg.
MNNIT, Allahabad.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
guys this is not the ideal place to discuss placement related questions .
plz query in interviewstreet group
On Mon, Nov 14, 2011 at 5:24 PM, wujin chen wujinchen...@gmail.com wrote:
two month ago , I passed yahoo written test in china.
data structure, algorithm , and given a code segment
guys its my sincere request to all .. before posting any question plz plz do
search for archives first . if you would had done that you could have got
better knowledge .
On Wed, Oct 5, 2011 at 9:14 PM, raman shukla shukla.rama...@gmail.comwrote:
Hey mate dont worry there is nothing like
do justify the name of the group ..
thnks
--
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.
package is 8.75 l that has 7.5l as fst mothn bonus .
so ctc is 8l
On Sun, Oct 2, 2011 at 2:10 AM, Sahil Garg garg.sahi...@gmail.com wrote:
how much package??
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Sun, Sep 25, 2011 at 1:32 AM, aditya kumar
aditya.kumar130
1st round was a written test . It had 30 mcq's . This was the easiest mcq's
.
20 simple aptitude questions were thr along with some 10 C questions .
21 students were shortlisted for the first round .
in the interview round they asked me basics questions possibly from all the
subjects .
1)
ne idea abt how r thy gonna conduct their interview rounds?
On Fri, Sep 30, 2011 at 12:18 AM, Sahil Garg garg.sahi...@gmail.com wrote:
plz do tell..
i also need sm intervw questions at the earliest..
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Thu, Sep 29, 2011 at
college?
On Thu, Sep 29, 2011 at 10:33 PM, aditya kumar aditya.kumar130...@gmail.com
wrote:
Guys does any one hve the idea about INTEL interview process for CS
students ?? The area they focus and types of question they ask .
If any have any idea plz help !
thnks
--
You received
Guys does any one hve the idea about INTEL interview process for CS students
?? The area they focus and types of question they ask .
If any have any idea plz help !
thnks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
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 htb...@gmail.com wrote:
can u explain more on the coding question u solved?
On Sep 26, 9:08 am, aditya kumar
585 + (160 + 5)for slowest transactions *999 for the rest of the
instructions!
On Tue, Sep 27, 2011 at 12:49 AM, Gene gene.ress...@gmail.com wrote:
You guys have the right idea except that since it's multiple choice
you can do this with no math. With 1000 data items and only 4 stages,
the
rajeev hw much did they offer u ?
On Tue, Sep 27, 2011 at 5:55 PM, rajeev bharshetty rajeevr...@gmail.comwrote:
Technical Interview :
- Tell me about yourself ?
I emphasized more on my OpenSource projects and the Contribution
to Amarok ( Video Player Project ). I
what package did they offer?
On Mon, Sep 26, 2011 at 9:41 AM, aditya kumar
aditya.kumar130...@gmail.comwrote:
1st round was a written test . It had 30 mcq's . This was the easiest mcq's
.
20 simple aptitude questions were thr along with some 10 C questions .
21 students were shortlisted
5.5 lakhs
On Mon, Sep 26, 2011 at 1:46 PM, Aditya Virmani virmanisadi...@gmail.comwrote:
what package did they offer?
On Mon, Sep 26, 2011 at 9:41 AM, aditya kumar
aditya.kumar130...@gmail.com wrote:
1st round was a written test . It had 30 mcq's . This was the easiest
mcq's .
20 simple
find the smallest of two number . then keep adding 1 to the smaller number
till you get the bigger number .
this will give you absolute diff so check for the correct ans .
in case you have floating number then add unit of fraction . and repeat the
same .
On Mon, Sep 26, 2011 at 7:33 PM,
+1 to abhishek
On Mon, Sep 26, 2011 at 11:44 PM, Abhishek Gupta
guptaabhishe...@gmail.comwrote:
thats basically taking twos' compliment and converting it to negative one
and then adding it..its the same principle...which is used for dividing two
numbers without using '/' and '-'...right
ya same pattern was in PESIT college .
but be careful in mcq's 26/30 was cutt off .. it was easy n ya thr was no
negative marking . in objective they had more stress on number system .
i got selected in Sourcebits :)
On Sun, Sep 25, 2011 at 11:14 AM, aanchal goyal goyal.aanch...@gmail.comwrote:
neone who has appeared for yahoo recently? can ne one mention thr i/w /
written rounds experience; they visited dce 3 days back also nit
surathkal...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
25, 2011 at 9:06 PM, Aditya Virmani virmanisadi...@gmail.comwrote:
neone who has appeared for yahoo recently? can ne one mention thr i/w /
written rounds experience; they visited dce 3 days back also nit
surathkal...
--
You received this message because you are subscribed to the Google
1st round was a written test . It had 30 mcq's . This was the easiest mcq's
.
20 simple aptitude questions were thr along with some 10 C questions .
21 students were shortlisted for the first round .
in the interview round they asked me basics questions possibly from all the
subjects .
1)
does any one have the idea about emc2 .?? if yes plz do share the details
--
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
on virtualization (virtual servers) and now moving
towards cloud computing
ALL THE BEST :) :)
On Sep 24, 6:46 pm, aditya kumar aditya.kumar130...@gmail.com wrote:
does any one have the idea about emc2 .?? if yes plz do share the details
--
You received this message because you are subscribed
c) 512
On Sun, Sep 25, 2011 at 9:53 AM, sivaviknesh s sivavikne...@gmail.comwrote:
Consider a virtual memory system in which the virtual page addresses are
mapped onto physical page addresses as follow
Virtual page address.. Physical page address
m sry i dint read the question properly
page no = vitual page % 3 ie 0 % 3 = 3
thrfre 3*1024 is starting addr of physical page
but the byte address will be 3*1024 + 512 = 3584
On Sun, Sep 25, 2011 at 10:12 AM, Vishnu Ganth crazyvishnu...@gmail.comwrote:
3584
On Sun, Sep 25, 2011 at 9:53 AM,
23, 2011 at 1:54 AM, aditya kumar
aditya.kumar130...@gmail.com wrote:
those three question they ASKD me in interview nt in coding round n they
are very particular abt coding
On Fri, Sep 23, 2011 at 1:53 AM, aditya kumar
aditya.kumar130...@gmail.com wrote:
11.5 fr our college
vich coll?
On Fri, Sep 23, 2011 at 5:28 PM, sameer gupta gupta.sameer...@gmail.comwrote:
its a telephonic interview ..please guide how to prepare...
and please post question if anyone had interview recently
--
You received this message because you are subscribed to the Google Groups
in arrays i guess it can be simply analysed checking the last element of
array(which can be obtained by sizeof) checking how the entries are filled
inn the array...
in linked list hair tortoise rule...initialize two pointers...one's step
size:1, second's step size two... run through the linked
11.5 fr our college
they will hve online test .. 3 coding question and u need to attempnt any
two ..25mcq's .. mcq;s wer mostly frm sql ..
Q- Given a linked list find whether the linked list is palindrome or not. I
gave him solution by modifying the linked list then i gave solution using
extra
those three question they ASKD me in interview nt in coding round n they are
very particular abt coding
On Fri, Sep 23, 2011 at 1:53 AM, aditya kumar
aditya.kumar130...@gmail.comwrote:
11.5 fr our college
they will hve online test .. 3 coding question and u need to attempnt any
two ..25mcq's
@yogesh: we can get second max by comparing n elements ie O(n).
On Sat, Sep 17, 2011 at 4:59 PM, Ashima . ashima.b...@gmail.com wrote:
ans 8:
it should be 40%
@dheeraj: if total is 100 percent and other person paid more than 1st
person.Than how can the 1st person's percentage be more than
i guess kadane's algo doesnt tell u abt the subarray element instead it
tells abt max sum of subarray . to get the element of subarray store the
end_offset whenever your max_sum changes .
On Sat, Sep 17, 2011 at 4:47 PM, sukran dhawan sukrandha...@gmail.comwrote:
kadane s algo
On Sat, Sep
see here the basic operation is comparision so we can express comaprision in
terms of order of O(n). newazz we still require n-1 comparisions to find
second max .
On Sat, Sep 17, 2011 at 5:06 PM, Yogesh Yadav medu...@gmail.com wrote:
@aditya:
comparing isn't complexity here... here it means
External Sort : source code or any link ??
--
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.
@prasanth : sinjalspecial is correct bt his code works for 1D array . for 2D
array you can think of array of 1D array and then implement the same .
newazz here is one link :
http://tech-queries.blogspot.com/2010/05/find-max-sum-in-2d-array.html
On Sat, Sep 17, 2011 at 8:43 PM, tech coder
, sachin goyal monugoya...@gmail.comwrote:
PLEASE CORRECT ME ADITYA
On Mon, Sep 5, 2011 at 11:52 AM, sachin goyal monugoya...@gmail.comwrote:
12345|12345
F|E
WE HAVE TO CREATE THE PATTERN LIKE
F E F E F E F E F E
ACCORDING TO MY UNDERSTANDING WE CAN DIRECTLY REPLACE THE 2ND
we need n/2 swaps
On Mon, Sep 5, 2011 at 2:34 PM, sachin goyal monugoya...@gmail.com wrote:
it means we r considring d value for 2*n...so need total n passes...
On Mon, Sep 5, 2011 at 1:33 PM, aditya kumar aditya.kumar130...@gmail.com
wrote:
@dheeraj : u are right . i dint read
doesnt ur soln fails for even n?
suppose initial config : ||
now starting with second n +2 th
FEFF||EFEE
next 4, n+4:
FEFE || EFEF
4th 5th EE are continuous, correct me if m wrong:
my soln wud rather start with swaping 2nd 2n - 2 th element... n/4
swaps...
On Sun, Sep 4, 2011 at 3:24
can ne one post their experience of their test???
On Mon, Sep 5, 2011 at 3:27 PM, siva viknesh sivavikne...@gmail.com wrote:
plz mail me too once u ve attended
On Sep 5, 7:09 am, Akshay Rastogi akr...@gmail.com wrote:
Ditto harshit :)
On Sun, Sep 4, 2011 at 7:36 PM, sinjanspecial
q4) floyds algorithm for shortest path .
On Sun, Sep 4, 2011 at 5:41 PM, sukran dhawan sukrandha...@gmail.comwrote:
for q3 :either both inorder and preorder traversal shud be stored or
inorder and postorder shud be stored
On Sun, Sep 4, 2011 at 2:54 PM, sukran dhawan
swap n/2-1 with n/2+1 , and then n/2-3 with n/2+3 till we reach n-1 .
so we need n/4 swaps .
On Sun, Sep 4, 2011 at 5:28 PM, Anup Ghatage ghat...@gmail.com wrote:
That's interesting.
when n = 3
We have been given this :F F F | E E E
Swap the middle element and it becomes: F E F | E F E
first do quick sort . ie (nlog n) then find kth largest/smallest .
On Sun, Sep 4, 2011 at 6:28 PM, learner nimish7andr...@gmail.com wrote:
something I Know using quick sort randomization function we can find
kt smallest/largest in unsorted array , but i am not able to write
code , please help
padding related questions have been discussed many times . plz search.
On Sun, Sep 4, 2011 at 4:13 PM, bharatkumar bagana
bagana.bharatku...@gmail.com wrote:
struct data
{
char a;
int b;
}__attribute__((packed));
This is way to get the actual size of struct without any padding
How to find longest common substring in two strings ?
i want efficent code and iff possible any method other than using suffix
tree .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
those 2 be exist in same LAN ?
If yes , how can router decides to which subnet it has to pass
through the
incoming packet ..
On Fri, Sep 2, 2011 at 6:36 PM, aditya kumar
aditya.kumar130...@gmail.comwrote:
their wont be any conflict in ip address . coz within dhcp assigns
ip
Rs 100800 // this is CTC
basic pay is around 7lakhs
On Fri, Sep 2, 2011 at 1:15 PM, sukran dhawan sukrandha...@gmail.comwrote:
how much they pay ?
On Fri, Sep 2, 2011 at 11:24 AM, aditya kumar
aditya.kumar130...@gmail.com wrote:
they basically ask questions on DBMS and networking
haha ya i missd one zero its rs 1008000 ctc
On Fri, Sep 2, 2011 at 6:09 PM, sukran dhawan sukrandha...@gmail.comwrote:
i think u missed a zero :)
On Fri, Sep 2, 2011 at 5:49 PM, aditya kumar aditya.kumar130...@gmail.com
wrote:
Rs 100800 // this is CTC
basic pay is around 7lakhs
their wont be any conflict in ip address . coz within dhcp assigns ip
adsress from the pool of available address and within the n/w (LAN) we need
to have unique ip address bt across the n/w (LAN) we can use same ip from
the pool of ip addresses .
On Sat, Sep 3, 2011 at 1:56 AM, sagar pareek
stack coz of the lifo nature . i guess so
On Fri, Sep 2, 2011 at 11:08 AM, Mani Bharathi manibharat...@gmail.comwrote:
@kb2029: how? why?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
they basically ask questions on DBMS and networking.
In DBMS fst round mainly had SQL and 1 coding question related to ER DIAGRAM
.
in written round 3 question ws thr
1)ER diagram
2)stack n que
3)print this pattrn for n=3
X***X
*X*X*
**X***X**
***X*X***
X
***X*X***
**X***X**
static variables are allocated on heap . and global variables are sored on
data segment
On Fri, Sep 2, 2011 at 9:30 AM, rahul sharma rahul23111...@gmail.comwrote:
static variable is stored in data segement so it is alive thorugh the
proggo through let us c : data types
On Wed, Aug 31,
how did u get such o/p for k=4 ?? i dint get plz expalin
On Fri, Sep 2, 2011 at 9:04 AM, Anup Ghatage ghat...@gmail.com wrote:
Given an unsorted Array A and any integer k where k = size of A
Print the maximum of each sub-array of size k of A.
eg: A = [ 3, 5, 1, 9, 0, 4, -1, 7 ] k = 4
@rohit : else return (check(tree-left) || check(tree-right)); should be else
return (check(tree-left) check(tree-right));
we need both the left and the right to be true .
On Wed, Aug 31, 2011 at 4:18 PM, rohit raman.u...@gmail.com wrote:
Q1.
NODE* head //points to the bst(if it
@rahul : wen the values are pushed on to the stack they are like 9 , 8 , 7 ,
till 0 so when they pop out shouldnt it be follwing the order 0 1 2 till 9 .
i realy dont know why the o/p is 0 -1 -2 and so on ??
On Wed, Aug 31, 2011 at 8:18 PM, rahul sharma rahul23111...@gmail.comwrote:
i thnink it
@shady : +1
On Wed, Aug 31, 2011 at 10:22 PM, shady sinv...@gmail.com wrote:
you are banned... if this mail is genuine and then message me.
On Wed, Aug 31, 2011 at 9:16 PM, katie williams
katiewilliams...@gmail.com wrote:
*Immediate Need for Informatica Developer in IN !! $40/Hr Max...*
..100 or 99. So the probability is 47.9128/99*
*
*
*Here you are considering Sample space as length of the interval, right?
but
i think it should be cardinal({x/x belongs to Q and x belongs to
[1,100]}).*
On Fri, Aug 26, 2011 at 2:04 AM, Aditya Virmani
virmanisadi...@gmail.comwrote
void getSquareRoot(float s)
{
float a=s;
int i=0;
for(i=0;i20;i++)
{
a=(s+a*a)/(2*a);
}
printf(square root is %f,a);
}
On Tue, Aug 30, 2011 at 6:00 PM, Sanjay Rajpal srn...@gmail.com wrote:
Binary Search kind of mathod is useful here :
float SquareRoot(float n,float start,float
let u have to find the square root of s .
a=sqrt(s) ;
a^2=s ;
2(a^a)=s+a^2 ;
a=(s+a^2)/2a ;
after 20th iteration you will get more approximated value .
hopefully it will help .:)
On Tue, Aug 30, 2011 at 9:14 PM, teja bala pawanjalsa.t...@gmail.comwrote:
@aditya kumar
Will u plz explain
Kadane's Algorithm(array[1..n])
begin
(maxSum, maxStartIndex, maxEndIndex) := (-INFINITY, 0, 0)
currentMaxSum := 0
currentStartIndex := 1
for currentEndIndex := 1 to n do
currentMaxSum := currentMaxSum + array[currentEndIndex]
if currentMaxSum maxSum then
one more method : use system funtion .
eg system(cat filename) //system funtion executes the command
On Sun, Aug 28, 2011 at 1:51 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
good logic
On Sun, Aug 28, 2011 at 12:14 AM, Piyush Grover piyush4u.iit...@gmail.com
wrote:
yeah you can
it runs perfectly for me on both 64 bit 32 bit... check again
On Sun, Aug 28, 2011 at 2:20 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote:
The following C program segfaults of IA-64, but works fine on IA-32.
*int* main()
{
*int p;
p *=*
focus on quant di...verbal wud be easy...as in our college, thr were two
papers, on which had gud level of quant qns...qns were nt tough to crack,
but involved calculations which may take gud amt of time...like thr was 1
qn:
find the sum of first 1234 terms in the series 121221222112.
problem is the good old
spirit of a challenge (not merely for an interview) So the best way remains
the store everything way...
On Sun, Aug 28, 2011 at 3:11 PM, aditya kumar
aditya.kumar130...@gmail.com wrote:
one more method : use system funtion .
eg system(cat filename) //system funtion
My friend has shared his experience in this doc . He got selected .
hope it will help u guys as well !!
On Sat, Aug 27, 2011 at 12:12 PM, siva viknesh sivavikne...@gmail.comwrote:
hi search this group.. u ll get lot of interview ques recently
attended for ms
On Aug 27, 10:58 am, rahul
+1 Don... nthin is specified fr the nature of numbers if thy can be rational
or thy hav to be only natural/integral numbers...
On Wed, Aug 24, 2011 at 9:33 PM, Don dondod...@gmail.com wrote:
First find the endpoints of the region where the condition is met:
a + 100/a = 50
a^2 - 50a + 100 = 0
does anyone know the correct solution this problem ??
problem : i/p :: 39
o/p:: 93 (using bitwise operator)
On Fri, Aug 12, 2011 at 1:41 PM, Prakash D cegprak...@gmail.com wrote:
how does the above code work?
On Fri, Aug 12, 2011 at 1:14 PM, Rahul raikra...@gmail.com wrote:
I understand.
subtract the two check if its greater thn 0... c=a-b, if(c 1000 )
printf(a) else printf(b)
On Tue, Aug 23, 2011 at 7:50 PM, *$* gopi.komand...@gmail.com wrote:
int a,b;
int c=a-b;
c=c31;
int x =c0x01;
a=a-x*c;
Thx,
--Gopi
On Tue, Aug 23, 2011 at 7:32 PM, Sanjay Rajpal
what are the arrival time ??
On Tue, Aug 23, 2011 at 8:19 PM, saurabh singh saurab...@gmail.com wrote:
Given m jobs and p processors find the *most optimal scheduling.*
Is this problem NP complete like subset problem?
I am trying on a greedy solution but most of them are failing
--
(x(x(b+x(c+dx
On Tue, Aug 23, 2011 at 10:21 AM, saurabh agrawal saurabh...@gmail.comwrote:
Compute a+bx2+cx3+dx4+... efficiently (a,b,c...given)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
thnks all . yeah sure will post the questions :)
On Sat, Aug 20, 2011 at 4:29 PM, Akash Mukherjee akash...@gmail.com wrote:
@aditya - basic os networking, ds - esp trees(esp bsts) algo
if needed, refer cracking the coding interview. do post the questions asked
once its over :)
On Sat
heyy which subjects need to be studied more for AMAZON .?? AMAZON visiting
our campus 22nd aug .
--
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,
PESIT
On Sat, Aug 20, 2011 at 4:23 PM, Sanjay Rajpal srn...@gmail.com wrote:
which college ?
Sanju
:)
--
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
instead of that find sum of first n natural number sum ie (n(n+1))/2.;say
NSum
then find the sum of all elements of the array . say ASum
ASUm - NSum = result (no repeated twice).
On Fri, Aug 19, 2011 at 7:30 PM, Sanjay Rajpal tosanjayraj...@gmail.comwrote:
:)
*Regards
Sanju
Happy to Help
@priya..wht if a=b=0 ? or a=b= 1000
On Sat, Aug 20, 2011 at 11:33 PM, priya ramesh
love.for.programm...@gmail.com wrote:
the answer is 1
sum=1
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
thts a Google question...17 is the answer
On Sat, Aug 20, 2011 at 2:08 AM, Dave dave_and_da...@juno.com wrote:
@Icy: A few years ago this was reported to be a Microsoft interview
question. It is so well publicized now that most people here have
probably seen it.
1 and 2 cross.
1 returns.
:D just sayin mahn...bura mat maan :D
On Sun, Aug 21, 2011 at 12:23 AM, sagar pareek sagarpar...@gmail.comwrote:
@aditya
Any puzzle asked by any company doesn't mean that it belongs to that
particular company.
I encounter this question first time in 2005 through a flash game.
On Sun, Aug
Regards,
PAYAL GUPTA
On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani
virmanisadi...@gmail.com wrote:
If ü - Married
û - Not Married and
M-ü N-û
N-ü L-û
L-û M-ü
Who is married?
qn was put up in this way, asked in Deloitte 2004.
--
You received this message because you
this qn is copy pastewd as it is...no further instructions etc provided
On Fri, Aug 19, 2011 at 6:06 PM, priya ramesh
love.for.programm...@gmail.com wrote:
i think the question should be elaborated a li'l more. Plz give the
sentences given in the puzzle. May be we cud solve then
--
You
how abt subtracting . like a=a-b till a becomes zero . no of times
subtraction is done is the answer .
correct me if i am wrong !
On Thu, Aug 18, 2011 at 8:59 PM, Dave dave_and_da...@juno.com wrote:
@Radha: You could simulate long division. It would look something like
this:
int divide(int
not sure abt the algo but we can think in terms of tokeninzing . ie go for
greedy method . greedy looks for maximum match . extract the token and match
with the dictionary word . if match found then add the additional space else
look for next token .
On Thu, Aug 18, 2011 at 9:10 PM, Navneet Gupta
If ü - Married
û - Not Married and
M-ü N-û
N-ü L-û
L-û M-ü
Who is married?
qn was put up in this way, asked in Deloitte 2004.
--
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
take four cases :
1) A success B success C failure
2) A success B failure C success
3) A failure B success C success
4) A , B , C = success
add all the four cases :)
On Wed, Aug 17, 2011 at 5:23 PM, priya ramesh
love.for.programm...@gmail.com wrote:
A mistake from my side as well!
Got 78.8%
let the number be 935+69 = 1004
(bcoz divide 1004%935 = 69 )
now 1004 % 38 = 16 ANS
On Wed, Aug 17, 2011 at 5:39 PM, priya ramesh
love.for.programm...@gmail.com wrote:
if a number is divided by 935 remainder is 69. if same no. is divided by
38, what will be the remainder?
--
You received
no of days in a year shud be 365 or 366 ??
On Wed, Aug 17, 2011 at 5:49 PM, priya ramesh
love.for.programm...@gmail.com wrote:
what is the probability of having b'days of 2 persons on the same day in a
gathering of 50 persons?
--
You received this message because you are subscribed to the
@priya . i have shown you my method . write your method and we shall discuss
it .
On Wed, Aug 17, 2011 at 5:52 PM, sukran dhawan sukrandha...@gmail.comwrote:
On Wed, Aug 17, 2011 at 5:39 PM, priya ramesh
love.for.programm...@gmail.com wrote:
if a number is divided by 935 remainder is 69.
Is that exactly 2 or atleast 2?
P(atleast 2)=1-P(no 2 people )=1-(364*363*362*.*317/365^49)
On Aug 17, 5:24 pm, priya ramesh love.for.programm...@gmail.com
wrote:
nothing is specified. I guess it's 365
--
You received this message because you are subscribed to the Google Groups
i guess if the option is provided it would have been an appropiate question
.
On Wed, Aug 17, 2011 at 6:02 PM, Rohit Srivastava access2ro...@gmail.comwrote:
+1 to nitin
On Wed, Aug 17, 2011 at 6:02 PM, Romil ... vamosro...@gmail.comwrote:
People this is not the way to approach this
+1 sagar pareek...
i used the following approach:
let the num be xy
so...
(10y + x) - (10x + y) is the distance travelled in 1 hr...
now, the the next milestone must be a three digit number, which can be of
following compostion: 1xy or xzy or yzx whr 0=z9 coz aif z=9, distance
travlled in tht hr
1 - 100 of 226 matches
Mail list logo
