,
sum_{L=0,1,..n} O(L^2) = O(n^3) = O(m ^ 1.5)
with one character per branch. This is super-linear.
On Mar 13, 12:47 am, reynald reni reni.reyn...@gmail.com wrote:
Construct an infinite family of strings over a fixed alphabet, where
the total length of the edge-labels
Chunyuan, can this complexity be still reduced with any other data structure?
On 3/13/12, Chunyuan Ge hhy...@gmail.com wrote:
it's a classic problem like Time = O(n*n), space = O(n)
On Tue, Mar 13, 2012 at 12:55 PM, InThirstOfWisdom.rr
reni.reyn...@gmail.com wrote:
Algorithm to find the
Could anyone please tell me if Suffix Trees would be appropriate here
to use? or kindly suggest me a better data structure.
On 3/13/12, reynald reni reni.reyn...@gmail.com wrote:
Chunyuan, can this complexity be still reduced with any other data
structure?
On 3/13/12, Chunyuan Ge hhy
Construct an infinite family of strings over a fixed alphabet, where
the total length of the edge-labels on their suffix tree grows faster
than O(m), where 'm' is the length of the string. [That is, show that
linear time suffix tree algorithm would be impossible if edge-labels
were written
Hi guys! If any of is familiar with IBM-ISL recruitment process and
interview questions, please post. Thank you.
--
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
directly for interview and had to write no written
test as i was interning there.
On Sep 2, 6:54 pm, Reynald reynaldsus...@gmail.com wrote:
Hi guys! If any of is familiar with IBM-ISL recruitment process and
interview questions, please post. Thank you.
--
You received this message because
Question:
Given: A singly linked list and a number 'n'.
Write a program, that will reverse consecutive 'n' nodes in the linked list.
Optimize for space and time.
Example:
Input:
Linked list: A-B-C-D-E-F
number 'n': 3
Output:
C-B-A-F-E-D
--
Regards
Reynald Reni
Masters in Software Engineering
Question:
Given: A singly linked list and a number 'n'.
Write a program, that will reverse consecutive 'n' nodes in the linked
list.
Optimize for space and time.
Example:
Input:
Linked list: A-B-C-D-E-F
number 'n': 3
Output:
C-B-A-F-E-D
--
You received this message because you are subscribed
For example, in array, say,
8, 9, 2, 4, 6, 2, 3
Input 5, output 2 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
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Regards
Reynald Reni
Masters in Software Engineering
CIT - India
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
, Reynald reynaldsus...@gmail.com wrote:
ThoughtWorks is a global IT consultancy with an exclusive focus on end-
to-end global software development and delivery using advanced tools,
such as:
Java / J2EE
C# / .NET
Ruby
Agile Methodologies
EAI technologies like Tibco, MQSeries MSMQ
Web
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
Reynald Reni
Masters in Software Engineering
CIT - India
--
You received this message because you are subscribed to the Google Groups
ThoughtWorks is a global IT consultancy with an exclusive focus on end-
to-end global software development and delivery using advanced tools,
such as:
Java / J2EE
C# / .NET
Ruby
Agile Methodologies
EAI technologies like Tibco, MQSeries MSMQ
Web Services
The company's leadership in the practical
Could anyone please explain me how this query selects the employee
with nth highest salary?
select last_name, salary from employees e1
where n = (select count(distinct(salary)) from employees e2
where e2.salary = e1.salary);
--
You received this message because you are subscribed to the Google
Hi folks!
If any of you have Thoughworks flow questions, Coding rounds
questions, Technical interview questions kindly please share. Thank
you.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Sorry for the typo, Its Thoughtworks
On Wed, Aug 3, 2011 at 11:04 PM, Reynald reynaldsus...@gmail.com wrote:
Hi folks!
If any of you have Thoughworks flow questions, Coding rounds
questions, Technical interview questions kindly please share. Thank
you.
--
You received this message
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Regards
Reynald Reni
Masters in Software Engineering
CIT - India
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
A company sells ipods online. There are 100 stocks maintained at
Argentina and Brazil. A single ipod costs $100 in Brazil and $50 in
Argentina. The cost of exporting stocks from one country to the other
will cost $400 per 10 blocks. The transportation is always done in the
multiples of 10.
If a cow produces its first she-calf at age two years and after that
produces another single she-calf every year, how many she-calves are
there after 12 years? assuming none die.
and a similar one, asked to another guy,
Suppose a newly-born pair of rabbits, one male, one female, are put in
a
Write and implement an algorithm to find the nth Fibonacci number,
optimized for space and time.
--
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,
the number of cows produced from the she-calves of
the 1st cow, I get the foll numbers:
1+2+4+7+11+16+22+29+38+48+59+1(MainCow) = 238.
Correct me If am wrong.
Regards
Hemalatha
On Fri, Jul 29, 2011 at 11:45 AM, Reynald reynaldsus...@gmail.com wrote:
If a cow produces its first she-calf
???
On Fri, Jul 29, 2011 at 8:10 AM, Reynald reynaldsus...@gmail.com wrote:
1. What is a System Map file in Linux? Why do we need it?
2. Mention the file name which is a symbolic link to the system kernel.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Regards
Reynald Reni
Masters in Software Engineering
CIT - India
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group
1. What is a System Map file in Linux? Why do we need it?
2. Mention the file name which is a symbolic link to the system kernel.
--
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 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.
--
Regards
Reynald Reni
Masters in Software Engineering
Which of the following data structure do better job (has lesser time
complexity) at searching elements that has a worst-case time
complexity of O(n)? Do not account for the cost of building the Data
structure in searching cost.
a) Linked list with element sorted by value
b) Binary tree with no
Congrats! Which team did pick you up? Global Customer Support, Dev or
Testing QA.
On Sun, Jul 24, 2011 at 9:57 PM, Rahul Menon menonrahul1...@gmail.comwrote:
I am placed! :)
On Jul 20, 9:43 pm, Reynald Suz reynaldsus...@gmail.com wrote:
Round-1 :Aptitude (OS, SQL, Data Structures Problem
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.
--
Regards
Reynald Reni
Masters in Software Engineering
CIT - India
Find the possible class and the methods in it for “Snakes and ladders
game”. (HR asked to use Design Patterns if needed)
--
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
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Regards
Reynald Reni
Masters in Software Engineering
CIT - India
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
Implement an algorithm to determine if a string has all unique
characters. What if you can not use additional data structures?
--
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
Code: A
int main()
{
int x = 10;
while ( x = --x)
printf( %d , x);
getchar();
}
Code: B
int main()
{
int x = 10;
while ( x = x--)
printf( %d , x);
getchar();
}
Does Code-A and Code-B work similar? Justify.
--
You received this message because you are
-- is 1 so while condition
executing and prints x value as zero.
On 7/21/11, Reynald reynaldsus...@gmail.com wrote:
Code: A
int main()
{
int x = 10;
while ( x = --x)
printf( %d , x);
getchar();
}
Code: B
int main()
{
int x = 10;
while ( x = x
Given the following program, MS will be printed, infinite number of
times:
int n = 20;
int i;
for (i=0; in; i--)
printf(MS);
Apply one of the following three operations one at a time such that
MS can be printed 20 times.
1. You can add only one character into it.
2.
Given a Parent -Child binary tree ,build the child -sibling version of
it?
Minimize the space requirements wherever possible.
--
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
Algo to find the border of a given binary tree. Optimized for space
and time.
Input:
10
/ \
50 50
/ \ / \
25 75 20020
/ \ / /\
15 35 120155 250
Output:50 25 15 35 120 155 250 20 150 10
--
You received this
Maheshwari
shubham.veloc...@gmail.com wrote:
according to saagar's algo, it'll be printed ...
On Sun, Jul 17, 2011 at 1:02 AM, swetha rahul
swetharahu...@gmail.comwrote:
@Reynald
Will 75 not be included in the tree that u
have given..??
On Sun, Jul
Yep!
On Sun, Jul 17, 2011 at 1:02 AM, swetha rahul swetharahu...@gmail.comwrote:
@Reynald
Will 75 not be included in the tree that u have
given..??
On Sun, Jul 17, 2011 at 12:49 AM, sagar pareek sagarpar...@gmail.comwrote:
here is the code
void border(node
://groups.google.com/group/algogeeks?hl=en.
--
Cheers
Reynald Reni
--
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
39 matches
Mail list logo
