details :
- Duration available for work.
- College and Branch.
--
Prateek Gupta
MNNIT Allahabad.
--
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
Hey all
Is anyone ever get interviewed in Rocket Fuel ? Can someone please tell
what type of questions they have asked ?
Thanks
Prateek
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails
I think this question can be done in O((m-n)*n) where m is the length of
larger string and n is the length of smaller string
Prateek Khandelwal
Software Engineer in Directi
+91-7042393719
On Tue, Oct 7, 2014 at 6:06 PM, vikas vikas.rastogi2...@gmail.com wrote:
question unclear ?What
Just think in this manner that put 0 star in front, then 1 star in front
and so on and while doing this just compare both the strings. If you are
not able to understand just tell me I will mail my code to you.
Prateek Khandelwal
Software Engineer in Directi
+91-7042393719
On Tue, Oct 7, 2014
2-2 as 2 lies in [2,3] and [1,4] ?
On Sun, Jun 9, 2013 at 12:50 PM, Monish Gupta monish.gup...@gmail.comwrote:
There are n Intervals. Given a set of m numbers, tell in how many
intervals does each number exists.
Example: 4 Intervals: [2,3] [3,4] [1,4] [3,10]. Numbers {2,4,11}
For 2 - 1 as 2
I think there is no need for such a complex code. use length() method to
get the size of the stack and return the middle element i.e.
m=S.length()
if(m is even)
return arr[m/2]
else
return arr[m+1/2]
it can be done in O(const) time
On Thu, May 23, 2013 at 12:54 PM, Avi Dullu
@kartik +1:P :P
PS : pardon the pun.
On Sat, Nov 24, 2012 at 11:42 AM, Kartik Sachan kartik.sac...@gmail.comwrote:
hey anybody has any idea about video streaming using vlcj lib ??
--
*WITH REGARDS,
*KARTIK SACHAN
B.Tech. Final Year
Computer Science And Engineering
Motilal
Hi,
This one is quite easy. You have to calculate the number of one's before
every zero and add them up. That's it.
public class Test1 {
public void printArray(int[] tmpArr) {
for (int i : tmpArr) {
System.out.println(i);
}
}
public int calculateMinSwaps(int[] tmpArr) {
int minSwaps = 0;
int
main(a,b,m)
02{
03while (~scanf(%d%d,a,b))
04{
05 m=0;
06 while (a)
07 {
08if (a1)
09 m+=b;
10a=1;
11b=1;
12 }
13 printf(%d\n,m);
14}
15}
--
You received this message
yups...it is compiler dependent...but a logic is necessary to get 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
okk
--
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
built a tree (not binary) where the root node is the initial configuration
of pegs. For each possibility of movement of the initial configuration of
disks, a child node is created. Thus, for each child node created, I check
if the current configuration is the final configuration. If yes, problem
how is it 6?
++a(5) + ++a(6) + a++(6) it shud be 17
--
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
He asked me about my *projects* and technical background. So you should
know everything related to your projects.
*
Now my interview questions...*
1. What is the difference between *hasmap*, *bst* and *trie* ???
2. Compare *mergesort* and *quicksort* why in sort function of vectors
randomized
ya obviously...it is 1/3.no need of any data is required
On 1/18/12, sunny agrawal sunny816.i...@gmail.com wrote:
isn't the answer will be 1/3, without any calculations :)
On Thu, Jan 19, 2012 at 7:10 AM, Sundi sundi...@gmail.com wrote:
there are 52 cards.. there are 3 players a1,a2,a3
depends on the requirement of the code...
On Thu, Sep 22, 2011 at 11:00 AM, DIPANKAR DUTTA dutta.dipanka...@gmail.com
wrote:
Depends on compiler architecture , and how they
use instruction set architecture ( Increment Op) of underlining machine
On Thu, Sep 22, 2011 at 7:21 AM, Don
Brijesh is right.until u do the type casting it will show an error
On Fri, Sep 16, 2011 at 5:57 AM, Pradip Singh qnit...@gmail.com wrote:
it will print 2,5
On Fri, Sep 16, 2011 at 2:35 AM, Brijesh brijeshupadhyay...@gmail.comwrote:
On Friday, 16 September 2011 13:25:38 UTC+5:30,
9 and 3
--
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
@harshit
it is also possible with scanf(%[^\n]s) for multi word input
--
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
@piyush
the output will hello piyushit's due to following reason
you've declared array of 2 pointers to character(char *pstr[2]),which means
hello and piyush are stored somewhere else but your array is having only
starting addresses of each string.now when you are calling swap
oh i'm sorry guys galz,its my mistake..actually i forgot to add one
more field in struct
this is the correct one
typedef struct
{
int bit1:29;
int bit2:4;
}bit;
int main()
{
printf(%d\n,sizeof(bit));
return 0;
}
now what will be the output...i'm sure you will amazed to see the result
Anup has proposed good solution.use edit distance algorithm and
make matrix for insertion and deletion operation.
Last entry of the matrix will give the solution which says about minimum
possible operation to convert one string to other.
--
You received this message because you are
@kartik it's wrong output...output will be 8 bytes.I asked this question
just to give more clear picture of bit field
--
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
level order traversal can be a solution but since it is BST that we want to
store not binary tree(we can store binary tree using level order trav and
can reconstruct tree out of it) so we can just store the preorder traversal,
at time of reconstructing,scan through this traversal and pass the
#define g(a) #a
replaces any occurrence of g(a) with string a.
#define f(a,b) a##b
replaces any occurrence of f(a,b) with concatenation of a and b
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
@prashant
it is the same mid value as u calculate in binary search i.e. (lowest
index+highest index)/2
No matter whether it is 18 or 27,u gonna get almost balanced BST every time
if u do construct the tree as ankit has mentioned.
--
You received this message because you are subscribed to the
for(i=0;i16;i++)
printf(%d\n,(numi115)?
1:0);
consider the above code snippethere at each iteration num is being left
shifted,and it is being ANDed with 1000 same at d time.
here it is assumed that system is of 16 bit that's why loop is for 16
iterations.
it's better to work wid
in c++,classes have some by default feature like they have default
constructor,copy constructor
and overloaded =operator by default
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
int bit1:1;
above definition instructs compiler that use 1 bit for storing
integer(signed by default) in bit1.
Such notation is used for optimization of memory use.
So if someone stores 1 in bit1 then,it will be treated as -1 by compiler
since we have instructed the compiler to store it in one
In c++ we have default copy constructor ,which is called when we use
statement like e2=e;ie when object are of same class type.
On Aug 28, 3:29 pm, ravi maggon maggonr...@gmail.com wrote:
Hi
Can you explain the below mentioned code. As far as I know we need to
overload = operator in order to
prepare well for di,
quant and va are easy but di is really hard.
1 ques that often appears in their test is
ABC
* EFG
-
7JK
L4N
PQR
---
---
some conditions will be given and you have to find which number does
@abhishek
yes i am appearing through offcampus drive.plz tell me regarding sql
and unix preparation as i belong to ECE and don't have good knowledge
of these subjects.
On Aug 16, 1:29 pm, abhishek abhishekgupta0...@gmail.com wrote:
@ prateek
r u appearing offcampus??? from which college u r
hey guys,
Tell me about amdocs interview questions and also post the good links
for preparation as my interview is scheduled on friday.
thanks in advance.
Regards
Prateek Gupta
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
.
--
Prateek Gupta
7th sem, Information Technology,
Netaji Subhas Institute Of Technology
Delhi.
--
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 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.
--
Prateek Gupta
7th sem, Information Technology,
Netaji Subhas
/algogeeks?hl=en.
--
Prateek Gupta
7th sem, Information Technology,
Netaji Subhas Institute Of Technology
Delhi.
--
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
Can anyone plz tell me
1. how to get a fair result from a unfair coin?
2. How to use a fair coin to get unfair result?
--
Prateek 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
void quicksort( T[] A, Integer left, Integer right)
if ( left right )
q = partition( A, left, right) ;
quicksort ( A, left, q–1);
quicksort ( A, q+1, right) ;
Integer partition( T[] A, Integer left, Integer right)
m = left + right / 2;
swap( A[left], A[m]);
pivot = A[left] ;
lo =
In naive string matching how can the knowledge abt. pattern that it has all
different characters can be used to accelerate the algorithm to O(n) .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
, 2011 at 11:19 AM, Piyush Sinha
ecstasy.piy...@gmail.comwrote:
Read KMP algorithm..
On Thu, Jun 23, 2011 at 11:17 AM, prateek gupta
prateek00...@gmail.comwrote:
In naive string matching how can the knowledge abt. pattern that it has
all different characters can be used to accelerate
no
the no of elements in an array should be known to compiler before execution
of the program.
On Tue, Jun 14, 2011 at 8:09 PM, amit amitthecoo...@gmail.com wrote:
is such a declaration correct:
cinx;
int a[x];
--
You received this message because you are subscribed to the Google Groups
the expression involving and and or operator is evaluated from left to right
uptill the point from where the value of the expression can be determined.
On Mon, Jun 13, 2011 at 6:17 PM, Shachindra A C sachindr...@gmail.comwrote:
|| and operators are called short circuit operators and need not
its working in dev-cpp.
On Sun, Jun 12, 2011 at 10:40 AM, Balaji S balaji.ceg...@gmail.com wrote:
no error ryt??
--
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
Hey Rajeev,
Can you mail me the pdf of the book.
My email is mailtoprat...@gmail.com.
The google doc isnt opening. It is giving an error - Sorry, we are
unable to retrieve the document for viewing or you don't have
permission to view the document..
Thanx in advance.
--
Prateek
On Apr 14, 9:29
the printf function returns 1 when it prints a string..
for (1;1i--;1)
{
printf(bat);
}
note that i=2 has been cunningly initialized before. and the decrement of i
has been done in middle expression of the for loop
hence, actually its like
for(;i--;)
{
}
how many times will this execute?
multiple instances will be reduced to some
extent..
Regards,
Prateek.
--~--~-~--~~~---~--~~
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
I think a better alternative could be to choose EVEN 5000 numbers
(taking mod of 2 of any number out of these can help to check whether
it can be in the set or not) and then make out set of 200 from these
5000 even numbers..
the set of 200 nos can be written on the disk in a sorted manner so
47 matches
Mail list logo
