Hi ,
I am Pavan from Infinate360 Consulting Services. Recently we saw your
linkedin profile and wanted to introduce our company which helps companies
in Adobe Solution Patner i.e Adobe analytics Implementation Services. We
have completed integrating with https://www.thecatalystacademy.org/ as our
Hello,
I am available from 8 a.m to 12 p.m
Best regards,
Mykhailo Shershen
T, 16. juuni 2020 16:32 Pavan_DigitalTechnocryne
kirjutas:
> Hi ,
>
>
>
> I am Mark from Infinate360 Consulting Services. Recently we saw your
> linkedin profile and wanted to introduce our company which helps
Hi Mark,
I will be available between 10 am to 4 pm tomorrow. So you can connect me
any time in between.
On Tue, 16 Jun 2020, 19:02 Pavan_DigitalTechnocryne, <
pavan.mtech1...@gmail.com> wrote:
> Hi ,
>
>
>
> I am Mark from Infinate360 Consulting Services. Recently we saw your
> linkedin profile
Rspected Sir ,
This is Yash Khandelwal here.
I received a mail from your side in which you mention that you visit my
LinkedIn profile. It's a great pleasure for me.
You are required some information to connect with me here are the same I
provided to you:
Email id: khandelwalyash...@gmail.com
Hi ,
I am Mark from Infinate360 Consulting Services. Recently we saw your
linkedin profile and wanted to introduce our company which helps companies
in Adobe Solution Patner i.e Adobe analytics Implementation Services. We
have completed integrating with https://www.thecatalystacademy.org/ as
Hi,
*Please drop in your resumes to sanj...@adobe.com sanj...@adobe.com.
*or *forward
this mail *to your respective college/school/office groups.
The hiring events have been scheduled to happen on:
- 18th January in Bangalore
- 25th January in Noida
*Position*
*Skill*
*Exp Range*
It is worse than the knapsack problem because not only does the size of
each item matter, but its placement on the sheet matters. I don't think
that there is a practical solution which is always optimal. You can get a
pretty good solution by placing as many letters as possible on the page
in
Is this not similar to knapsack problem?
On Fri, Jun 21, 2013 at 11:24 AM, Ravi Ranjan ravi.cool2...@gmail.comwrote:
There is a Blank Paper Sheet, Given a list of characters and their sizes,
for ex. A, P, O, N, Q with different font sizes and designs.
Now we need to cut characters from given
There is a Blank Paper Sheet, Given a list of characters and their sizes,
for ex. A, P, O, N, Q with different font sizes and designs.
Now we need to cut characters from given sheet of paper of all sizes
atleast once. And also try to maxmize number of characters cut. Along with
this, when you
Generate all possible combinations (of r elements) inside an array of size
N
E.g. arr [] = {2,8,14} All possible combinations of r=2 will be {2,8},
{8,14}, {14,2}
Asked in adobe
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe
file redirection!! i did that too i was finding myself helplessi
tried every thing!! as a result, i missed on this question
On Wed, Dec 12, 2012 at 8:53 AM, saurabh singh saurab...@gmail.com wrote:
I would have replied back with I am doing it with C programming language
only. the read
1st:
freopen(filename,r,stdin);
while(scanf(%s,str)!=-1)
{
printf(%s\n,str);
}
On Sun, Dec 9, 2012 at 3:22 PM, manish untwal manishuntw...@gmail.comwrote:
I gave this interview in August this year, two of the question i was not
able to answer properly
1) how to print the content of file in
stdin is a file pointer.
freopen returns a file pointer..
I suggest using read system call.
For the second question it would be simply
(len)!/((frequency_0)!*(frequency_1)!*(frequency_2)!...)
However this will also contains permutations which begin with 0. So
subtract the number of
i answered with the...system call too..but he said...do it in C programming
language only don't use...system call here!!
On Tue, Dec 11, 2012 at 10:32 PM, saurabh singh saurab...@gmail.com wrote:
stdin is a file pointer.
freopen returns a file pointer..
I suggest using read system call.
For
i think, i replied with the same answer and he was not convinced
On Tue, Dec 11, 2012 at 11:02 AM, amrit harry dabbcomput...@gmail.comwrote:
1st:
freopen(filename,r,stdin);
while(scanf(%s,str)!=-1)
{
printf(%s\n,str);
}
On Sun, Dec 9, 2012 at 3:22 PM, manish untwal
I would have replied back with I am doing it with C programming language
only. the read function that we use is not an actual system call. It
is a *wrapper
to a system call*. Any other function that we use usually ends up in
calling some system call. The actual system call is called by low level
I gave this interview in August this year, two of the question i was not
able to answer properly
1) how to print the content of file in C without using the file pointer.
2) count the total number of permutation of a number in order O(n)
--
in fy2 , the variable arr[10] has not been declared and hence it should
display error message while compiling
Thanks
Kumar Anurag
On Wed, Oct 24, 2012 at 11:06 PM, rahul sharma rahul23111...@gmail.comwrote:
int arr[10] // in fyl 1
now in fyl 2
extern int *arr
void foo()
{
arr[0]=10;
}
i think arr[10] and int *arr are two different declaration when ,when
compiler tried to link with the memory of int arr[10] it could nt find it ,
as u have declraed it to be integer type pointer , and in file 1 it could
find integer pointer .
On Wed, Oct 24, 2012 at 11:06 PM, rahul sharma
@all.can u provide me working code for use of extern..whenever i try to
use..linker error comes...like any simple codefor use of extern
On Thu, Oct 25, 2012 at 9:49 AM, Nishant Pandey
nishant.bits.me...@gmail.com wrote:
i think arr[10] and int *arr are two different declaration when ,when
int arr[10] // in fyl 1
now in fyl 2
extern int *arr
void foo()
{
arr[0]=10;
}
what kind of problem can be there?in what condition and y?
plz comment
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
There is one linked list having two pointer one as usual next and other is
random pointer pointing to any random node in list.
write algo to make a duplicate of it.
Note:- Original list is const, Can't be modified.
i know O(n) solution when list can be modified , and o(n^2) when list can
be
http://www.geeksforgeeks.org/archives/1155
On Tue, Oct 23, 2012 at 1:36 AM, saket narayan.shiv...@gmail.com wrote:
There is one linked list having two pointer one as usual next and other is
random pointer pointing to any random node in list.
write algo to make a duplicate of it.
Note:-
use hash map...with key as original node and value as duplicate of this
node duplicate node next and random pointer is set to NULL initially.
now traverse whole linked list keep on adding node.
after this do another traversal of orig linked list taking key as orig
node ..duplicate=fetch
@atul +1
On Tuesday, 23 October 2012 14:17:34 UTC+5:30, atul007 wrote:
use hash map...with key as original node and value as duplicate of this
node duplicate node next and random pointer is set to NULL initially.
now traverse whole linked list keep on adding node.
after this do another
@dave sir: i understand your point, here my solution is only limited to
hold the divisor in range of integer..
On Sat, Sep 22, 2012 at 1:41 AM, Dave dave_and_da...@juno.com wrote:
@Rahul: What does this print for n = 193?
Dave
On Friday, September 21, 2012 12:14:18 AM UTC-5, Rahul Kumar
@Navin: It means that given a positive integer n whose decimal
representation ends in 3, find a multiple, m*n, which is written solely
with the digit 1. E.g., 3: 37 * 3 = 111; 13: 8547 * 13 = 111,111.
Dave
On Thursday, September 20, 2012 11:56:08 PM UTC-5, Navin Kumar wrote:
@all: Please
@Dave sir: Thanx for reply. your solution gives the exact multiple like 37
for 3, 8547 for 13. In the question i think we have to print the number
which is 13x8547 which will be very large (out of integer range).In
that case we have to store result in string.
On Fri, Sep 21, 2012 at 12:09
@Navin: No problem. Just print a 1 instead of a quotient digit. That makes
the code even simpler, like this:
int n=the number that ends with 3;
int divisor=1;
printf(1);
while( divisor != 0 )
{
printf(1);
divisor = 10 * (divisor % n) + 1;
}
printf(\n);
Dave
On Friday, September 21,
here is my code:
main()
{
int n=13;
int divisor=1;
int temp;
while( divisor n )
divisor = 10 * divisor + 1;
printf(%d\n , divisor);
temp = divisor;
while(n)
{
if(temp%n == 0)
break;
temp = 10 * (temp % n) + 1;
divisor = 10 * divisor + 1;
while( temp n )
{
I thought about it some more, and realize that my code wasn't correct. Try
this:
int n = the number that ends with 3; // e.g., int n = 13;
int d = 1;
while( d % n != 0 )
{
printf(1);
d = 10 * (d % n) + 1;
}
printf(1\n);
On Friday, September 21, 2012 11:07:29 AM UTC-5, Dave wrote:
@Rahul: What does this print for n = 193?
Dave
On Friday, September 21, 2012 12:14:18 AM UTC-5, Rahul Kumar Patle wrote:
here is my code:
main()
{
int n=13;
int divisor=1;
int temp;
while( divisor n )
divisor = 10 * divisor + 1;
printf(%d\n , divisor);
temp = divisor;
while(n)
what is the solution(not brute force) for 8th question ?
On Fri, Sep 14, 2012 at 5:19 PM, Bhupendra Dubey bhupendra@gmail.comwrote:
Which edition of barron?
On Wed, Sep 28, 2011 at 6:05 PM, VIHARRI viharri@gmail.com wrote:
1. Java uses stack for byte code in JVM - each instruction
@Bharat: Simulate long division, dividing a number ...1 by the number.
You can do this one digit at a time, printing the quotient digit by digit
until you bring down a zero. It could look something like this:
int n=the number that ends with 3;
int divisor=1;
while( divisor n )
divisor
@all: Please explain question number 8. I am not getting the question
exactly what it says ?
On Fri, Sep 21, 2012 at 9:30 AM, Dave dave_and_da...@juno.com wrote:
@Bharat: Simulate long division, dividing a number ...1 by the number.
You can do this one digit at a time, printing the
Which edition of barron?
On Wed, Sep 28, 2011 at 6:05 PM, VIHARRI viharri@gmail.com wrote:
1. Java uses stack for byte code in JVM - each instruction is of one
byte, so how many such instructions are possible in an operating
system.
2. Three processes p1, p2, p3, p4 - each have sizes
There was a question in written round that there is a global static
variable ‘lock’ initially set to 0 and there was a code segment given.
while(lock);
lock = 1;
//Critical section
lock = 0;
Does this solve critical section problem.
--
You received this message because you are subscribed to
No...
say process 1 set lock variable to 1 and gets pre-empted .. process2
executes the same code and comes to critical section and gets pre-empted..
now process1 resumed.. NOW BOTH ARE IN CRITICAL SECTION ..
On Thu, Sep 13, 2012 at 7:14 PM, Ayush Kapoor ayush21011...@gmail.comwrote:
There
Could u tell me about question u got??
On 25 July 2012 22:02, Amit Jain aj201...@gmail.com wrote:
I assumed, You were called for Interview off-campus.
It depends upon the profile You have been called for. BTW it was too easy
for White box testing.
On Wed, Jul 25, 2012 at 8:13 PM,
Hello all,
i need help for Adobe and Amazon test asap ( Developer profile for both ).
On Fri, Jul 27, 2012 at 11:33 PM, Avinash Mishra mishra.avinas...@gmail.com
wrote:
Could u tell me about question u got??
On 25 July 2012 22:02, Amit Jain aj201...@gmail.com wrote:
I assumed, You were
I assumed, You were called for Interview off-campus.
It depends upon the profile You have been called for. BTW it was too easy
for White box testing.
On Wed, Jul 25, 2012 at 8:13 PM, deepikaanand swinyanand...@gmail.comwrote:
can anybody tell me which topics are asked in adobe apti test...and
can anybody tell me which topics are asked in adobe apti test...and what is
the usual level of qs asked in aptitude test...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
@himanshu making constructor protected is okay because even for abstract
base class u cannot create objects in derived class
--
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
If the constructor is made protected u cannot make object of that class
anywhere
On Tue, Jul 10, 2012 at 3:10 PM, Bhaskar Kushwaha
bhaskar.kushwaha2...@gmail.com wrote:
@himanshu making constructor protected is okay because even for abstract
base class u cannot create objects in derived class
Using Two Mallocs :
int *data;
int **arr;
data = malloc(sizeof(int) * nrows * ncols );
arr = malloc(sizeof(int*) * nrows);
for ( int i = 0; i nrows; i++) {
arr[i] = data[ i * ncols ];
}
--
Akshat Sapra
Under Graduation(B.Tech)
IIIT-Allahabad(Amethi Campus)
@akshat +1
On 7/1/12, Akshat Sapra sapraaks...@gmail.com wrote:
Using Two Mallocs :
int *data;
int **arr;
data = malloc(sizeof(int) * nrows * ncols );
arr = malloc(sizeof(int*) * nrows);
for ( int i = 0; i nrows; i++) {
arr[i] = data[ i * ncols ];
}
--
Akshat Sapra
Under
these are asked for which profyl??developer or white box??
On Sat, Jun 30, 2012 at 8:03 PM, Amol Sharma amolsharm...@gmail.com wrote:
@sarthak :
in your first solution aren't you using nrows+1 malloc's ?
second solution is good using 1 malloc.
--
Amol Sharma
Final Year Student
Computer
i dont knw read it in some paper.. most prob developer.
On Sat, Jun 30, 2012 at 9:56 PM, rahul sharma rahul23111...@gmail.comwrote:
these are asked for which profyl??developer or white box??
On Sat, Jun 30, 2012 at 8:03 PM, Amol Sharma amolsharm...@gmail.comwrote:
@sarthak :
2 malloc():
int **a=(int **)malloc(sizeof(int *)*nrows);
for(i=0;inrows;i++)
a[i]=(int *)malloc(sizeof(int)*ncols);
using only 1 malloc:
int **a=(int **)malloc(sizeof(int *)*nrows+(nrows*ncols)*(sizeof(int)));
for(i=0;inrows;i++)
{
a[i]=(int*)(a+nrows+i*ncols);
}
On Fri, Jun 29, 2012 at 4:46 PM,
*Sent:* Friday, 22 June 2012 1:44 PM
*Subject:* [algogeeks] Adobe interview question
How will u implement an abstract class in c++ w/o using pure virtual
function???
will making all the constructors and assignment operators protected
suffice???
i doubt since the derived classes
peacelover1987...@yahoo.co.in wrote:
Make all constructors private.
--
*From:* himanshu kansal himanshukansal...@gmail.com
*To:* Algorithm Geeks algogeeks@googlegroups.com
*Sent:* Friday, 22 June 2012 1:44 PM
*Subject:* [algogeeks] Adobe interview question
How
constructors private.
--
*From:* himanshu kansal himanshukansal...@gmail.com
*To:* Algorithm Geeks algogeeks@googlegroups.com
*Sent:* Friday, 22 June 2012 1:44 PM
*Subject:* [algogeeks] Adobe interview question
How will u implement an abstract class in c++ w/o using
*Subject:* [algogeeks] Adobe interview question
How will u implement an abstract class in c++ w/o using pure virtual
function???
will making all the constructors and assignment operators protected
suffice???
i doubt since the derived classes will be able to create objects of
that class
How will u implement an abstract class in c++ w/o using pure virtual
function???
will making all the constructors and assignment operators protected
suffice???
i doubt since the derived classes will be able to create objects of
that classand according to definition of abstract class, no
Make all constructors private.
From: himanshu kansal himanshukansal...@gmail.com
To: Algorithm Geeks algogeeks@googlegroups.com
Sent: Friday, 22 June 2012 1:44 PM
Subject: [algogeeks] Adobe interview question
How will u implement an abstract class in c++ w/o
It can done using pure virtual destructor.
struct A
{
//your implementation ..
..
..
virtual ~A() = 0;
};
A::~A()
{
}
--
Amitesh
On Fri, Jun 22, 2012 at 1:44 PM, himanshu kansal
himanshukansal...@gmail.com wrote:
How will u implement an abstract class in c++ w/o using
a pure virtual function does not have definition. Since pure virtual
destructor has a definition so its only for not allowing the object
instantiation, although it does not have any other abstract functions.
--
Amitesh
On Fri, Jun 22, 2012 at 1:51 PM, Amitesh Singh
.
--
*From:* himanshu kansal himanshukansal...@gmail.com
*To:* Algorithm Geeks algogeeks@googlegroups.com
*Sent:* Friday, 22 June 2012 1:44 PM
*Subject:* [algogeeks] Adobe interview question
How will u implement an abstract class in c++ w/o using pure virtual
function
Also, goto cannot jump across functions , which imposes a major setback
for its use in exception handling
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
signals and logjmp/setjmp()
--
Amitesh
On Wed, Jun 13, 2012 at 10:40 AM, saurabh singh saurab...@gmail.com wrote:
tHE first thing that comes in my mind Signals
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Tue, Jun 12, 2012 at 10:26 PM,
How about using goto label?? and at label using a switch case with respect
to turn around with values??
On Wed, Jun 13, 2012 at 11:56 AM, Amitesh Singh singh.amit...@gmail.comwrote:
signals and logjmp/setjmp()
--
Amitesh
On Wed, Jun 13, 2012 at 10:40 AM, saurabh singh
i dont think goto will be a good option , there might be a situation where
your program may get stuck jumping
on the labels , performance will get hampered , i feel singnals are good
options to go for it .
On Wed, Jun 13, 2012 at 12:37 PM, Raghavendhra Chowdary MV
raghavendhra20061...@gmail.com
how can we implement exception handling in c?
--
Regards
Anika Jain
--
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
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
yes u can review that link :)
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 you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
tHE first thing that comes in my mind Signals
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Tue, Jun 12, 2012 at 10:26 PM, Shashank Narayan
shashank7andr...@gmail.com wrote:
yes u can review that link :)
On Tue, Jun 12, 2012 at 9:47 PM, Anika Jain
This was asked from my friend in January for MTS profile.
Q1) Given a matrix with letters in each square and you have to find words
which are there in the dictionary (like Children's Crosswords). You have
been given a function which outputs 1 if the given word is in the
dictionary. The word
N = (N | ((1(j-i+1)-1)i) (Mi);
On 12 October 2011 01:22, prasad jondhale jondhale.pra...@gmail.com wrote:
grt
--
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
N=(N( (~0j) | (~(1i))) | (Mi)
With regards,
Praveen Raj
DCE-IT
735993
praveen0...@gmail.com
On Tue, Oct 25, 2011 at 11:46 AM, Bittu Sarkar bittu...@gmail.com wrote:
N = (N | ((1(j-i+1)-1)i) (Mi);
On 12 October 2011 01:22, prasad jondhale jondhale.pra...@gmail.comwrote:
grt
This is a question from Laakman.
This code operates by clearing all bits in N between position i and j, and then
ORing to put M in there
1 public static int updateBits(int n, int m, int i, int j) {
2 int max = ~0; /* All 1's */
3
4 // 1's through position j, then 0's
5 int left = max
grt
--
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
IIIT-Delhi
On Wed, Oct 5, 2011 at 8:45 AM, gaurav yadav gauravyadav1...@gmail.comwrote:
which college?
--
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
Hi
On 6 October 2011 23:11, DIVIJ WADHAWAN divij...@gmail.com wrote:
IIIT-Delhi
Get your algos strong. Esp. Linked List and string manipulations.
Be ready to give optimized solutions to problems.
A few questions from scalability are also asked sometimes
On Wed, Oct 5, 2011 at 8:45 AM,
Hi I need help regarding Adobe Placements for the position of software
developer.
What kind of questions they ask ? Their interview rounds etc . its
coming in my college on 13th October.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
which college?
--
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
You are given two 32-bit numbers, N and M, and two bit positions, i and j.
Write a method to set all bits between i and j in N equal to M (e.g., M
becomes a substring of N located at i and starting at j).
EXAMPLE:
Input: N = 100, M = 10101, i = 2, j = 6
Output: N = 10001010100
_
Adobe is coming to my college in mid October.
Can someone tell me what kind of questions do they ask, number and types of
rounds etc ??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
which coll ?
On Wed, Sep 28, 2011 at 2:49 PM, DIVIJ WADHAWAN divij...@gmail.com wrote:
Adobe is coming to my college in mid October.
Can someone tell me what kind of questions do they ask, number and types of
rounds etc ??
--
You received this message because you are subscribed to the
IIIT-Delhi
On Wed, Sep 28, 2011 at 3:03 PM, sukran dhawan sukrandha...@gmail.comwrote:
which coll ?
On Wed, Sep 28, 2011 at 2:49 PM, DIVIJ WADHAWAN divij...@gmail.comwrote:
Adobe is coming to my college in mid October.
Can someone tell me what kind of questions do they ask, number and
On 28 September 2011 15:10, DIVIJ WADHAWAN divij...@gmail.com wrote:
IIIT-Delhi
profile ?
On Wed, Sep 28, 2011 at 3:03 PM, sukran dhawan sukrandha...@gmail.comwrote:
which coll ?
On Wed, Sep 28, 2011 at 2:49 PM, DIVIJ WADHAWAN divij...@gmail.comwrote:
Adobe is coming to my college
We belong to IT so they would be taking programmers , I don't know anything
formally yet. Just know its coming !!
On Wed, Sep 28, 2011 at 3:19 PM, siddharth srivastava
akssps...@gmail.comwrote:
On 28 September 2011 15:10, DIVIJ WADHAWAN divij...@gmail.com wrote:
IIIT-Delhi
profile ?
developer or tester...wats packageif 6-8 then testing ig10 then
developerquestions vary from profyl ton profyl
On Wed, Sep 28, 2011 at 3:22 PM, DIVIJ WADHAWAN divij...@gmail.com wrote:
We belong to IT so they would be taking programmers , I don't know anything
formally yet. Just
1. Java uses stack for byte code in JVM - each instruction is of one
byte, so how many such instructions are possible in an operating
system.
2. Three processes p1, p2, p3, p4 - each have sizes 1GB, 1.2GB, 2GB,
1GB. And each processes is executed as a time sharing fashion. Will
they be executed
You have a library provided by the vendor. All you have is header files and
library files.
Library contains the class Shape and there is whole hierarchy tree (i mean
classes which derive from this base class).
Now you want to add some function getArea (not originally present in the
class or any of
Can any one pls post the questions that were asked in Adobe written test ???
And also pattern of the paper
--
Regards:
---
K Pavan Kumar
Computer Science Engg.
2nd Mtech, IIT Madras.
--
You received this message because you are subscribed to the Google Groups
How did u solved :
3) There is a list containing the checkin and checkout time of every person
in a party . The checkin time is in ascending order while the checkout is
random .
Eg:
Check_inCheck_out
Person 1 8.00 9.00
i think find max and min of all time-stamps respectively
On Mon, Aug 22, 2011 at 12:44 PM, saurabh agrawal saurabh...@gmail.comwrote:
How did u solved :
3) There is a list containing the checkin and checkout time of every person
in a party . The checkin time is in ascending order while the
@saurabh
pls post ur solutions too
On Mon, Aug 22, 2011 at 12:48 PM, Jagannath Prasad Das
jpdasi...@gmail.comwrote:
i think find max and min of all time-stamps respectively
On Mon, Aug 22, 2011 at 12:44 PM, saurabh agrawal saurabh...@gmail.comwrote:
How did u solved :
3) There is a list
for the stick prob is the stick length required?
On Mon, Aug 22, 2011 at 12:48 PM, Jagannath Prasad Das
jpdasi...@gmail.comwrote:
i think find max and min of all time-stamps respectively
On Mon, Aug 22, 2011 at 12:44 PM, saurabh agrawal saurabh...@gmail.comwrote:
How did u solved :
3)
Sticks length not required . Think in coordinate geometry in 3D .
Also for Checkin and Checkout question - Make a flag array associated with
each element of the list and initialize the every element to *{1}* and
traverse the checkout list (checkout[i]) . Now do binary search for an entry
in
Hi,
This is my Adobe interview experience for freshers :
*Written Test:*
Engineering – 45 Minutes - Data Structures, Algorithms,
Operating Systems
C/C++ – 45 Minutes - C/C++ Fundamentals Coding
Aptitude– 45 Minutes –
Has anyone recently appeared for Adobe off campus event? The profile
is C/C++ programming as MTS. It is for 1 yr experienced or more
candidates.
Any pointers for its preparation are welcome :)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
Is Adobe open now for offcampus recruitment??
Regards
Rubal Singh
On Thu, Aug 18, 2011 at 5:11 PM, anon kaustubh.c...@gmail.com wrote:
Has anyone recently appeared for Adobe off campus event? The profile
is C/C++ programming as MTS. It is for 1 yr experienced or more
candidates.
Any
guys please keep updating about any off campus event
Thank you,
Siddharam
On Thu, Aug 18, 2011 at 10:28 PM, rubal singh singhisru...@gmail.comwrote:
Is Adobe open now for offcampus recruitment??
Regards
Rubal Singh
On Thu, Aug 18, 2011 at 5:11 PM, anon kaustubh.c...@gmail.com wrote:
Has
MICROSOFT is inviting off-campus recruitments..jst check MS website for
more info ..
--
Rahul Tiwari aka DONE
B Tech Final Year
Information Technology
Motilal Nehru National Institute of Technology , Allahabad
9838339030
--
You received this message because you are subscribed to the
+1 siddharam
plzz...inform any off campus...if any1 has any idea..
Regards,
PAYAL GUPTA.
On Thu, Aug 18, 2011 at 11:27 PM, siddharam suresh
siddharam@gmail.comwrote:
guys please keep updating about any off campus event
Thank you,
Siddharam
On Thu, Aug 18, 2011 at 10:28 PM, rubal
i m sorry i cant understand the question.. if there are n no. steps to cross
and he can take only one step at a time.. then suppose n=3 then obviously
doesnt he need to take step 1 first then step 2 then step 3.. ?? m confused!
On Sun, Aug 14, 2011 at 12:38 AM, Kamakshii Aggarwal
actually here jumping of steps mean it can jump over 1 step at max. like if
it is at step no 1 he can jump to 3 as well as 2 but not to 4.
Soln is Fibonacci eqn.
t(n)=t(n-1)+t(n-2);
where t(1)=2 and t(2)=3
On Mon, Aug 15, 2011 at 6:06 PM, Anika Jain anika.jai...@gmail.com wrote:
i m sorry i
There is a river and there are n number of steps between two banks of the
river to cross the river.
A frog wants to cross the river with the condition that he can jump max one
step. Find the number of ways he can cross the river?
For e.g. if there are 3 steps in between, frog can go from
dp problem, refer to dp from AFI
On Sat, Aug 13, 2011 at 9:01 PM, Decipher ankurseth...@gmail.com wrote:
There is a river and there are n number of steps between two banks of the
river to cross the river.
A frog wants to cross the river with the condition that he can jump max one
step. Find
1 - 100 of 188 matches
Mail list logo
