congrats :)
On Feb 29, 8:28 pm, Umer Farooq wrote:
> congratz dude! :-)
>
> And best of luck with your future endeavours.
>
> On Wed, Feb 29, 2012 at 11:05 PM, Ravi Ranjan wrote:
>
>
>
>
>
>
>
>
>
> > @all
>
> > 3 round liye
>
> > 1.5 hours each only data structure n algorithm n 2 qstns from OS
4 5 6 5
> 3) 1 2 3 4 5 6 7 4
> 4) 1 2 3 4 5 6 7 8 8
>
> On Wed, Feb 15, 2012 at 11:38 PM, Dheeraj Sharma <
>
> dheerajsharma1...@gmail.com> wrote:
> > yeah..we need to calculate some formula
>
> > On Wed, Feb 15, 2012 at 10:21 PM, pavan wrote
i am getting WA by implementing TRIE .can anyone help me with the test
cases for which the following code is failing.
#include
#include
#include
#include
#define MAX 26
#define LEN 1000
using namespace std;
struct node
{
char c;
int isterminal;
int no_children;
st
@Utkarsh: yeah it is josephsus problem with a slight change.using
a linked list will give u TLE i guess.
On Feb 14, 10:36 pm, vickywiz wrote:
> in 1 2 3 4 5 6...o/p "ll b 5
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to thi
p, 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:
---
K Pavan K
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 Go
