Hacker rank exam

[WHAT]

13 hours ago, abbajabbadebba said:

T.V through vere valla help tiskocha?

edit cheyi babu ee post ni.....  @abbajabbadebba

[cosmopolitan]

Kasta padi rayachu kadha.. ala pass ayithe vache confidence veru 

[johnubhai_01]

31 minutes ago, WHAT said:

edit cheyi babu ee post ni.....  @abbajabbadebba

screenshots effect aa.. chala cautious ga unnav  

[MuPaGuNa]

40 minutes ago, vendettaa said:

ledu 2 hrs, 8 objective and 2 programming exercises

last week nenu raasa.....1 hr time,10 objective,2 programming...linked list ichadu....objective lo kooda 5 programs ichadu.....

[vendettaa]

1 minute ago, MuPaGuNa said:

last week nenu raasa.....1 hr time,10 objective,2 programming...linked list ichadu....objective lo kooda 5 programs ichadu.....

objective lo kuda graphs, stack  questions unay  and rest quant 

programming lo okati matrices di daniki chala add chesadu 

inkoti kuda ante 

python lo code chesa but still  first di debug chesesarki time chuste 20 mins left wrong results, errors  time leka poyay

practise test ichi lite chala easy ankunna , aa practise test kanna 1000 times tough 

inka poynatte aa opportunity 

 

[pachimirchi]

sample ga konni qs veyyandi vayya 

[WHAT]

26 minutes ago, johnubhai_01 said:

screenshots effect aa.. chala cautious ga unnav  

haa mods elagu pattinchukoru.... vallu inka free publicity anukuntaru kavachu

[vendettaa]

17 minutes ago, pachimirchi said:

sample ga konni qs veyyandi vayya 

Time complexity of 

void fun()

{

   int i, j;

   for (i=1; i<=n; i++)

      for (j=1; j<=log(i); j++)

         printf("afdb");

}

[vendettaa]

The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively. The postorder traversal of the binary tree is:
(A) d e b f g c a
(B) e d b g f c a
(C) e d b f g c a
(D) d e f g b c a

 

ivi simple questions objective lo

[johnubhai_01]

18 minutes ago, WHAT said:

haa mods elagu pattinchukoru.... vallu inka free publicity anukuntaru kavachu

[budamkayabalraj]

8 minutes ago, vendettaa said:

The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively. The postorder traversal of the binary tree is:
(A) d e b f g c a
(B) e d b g f c a
(C) e d b f g c a
(D) d e f g b c a

 

ivi simple questions objective lo

Oh.. ila objectives kuda untaya

nenu only program matrame untay anukunna

[johnubhai_01]

16 minutes ago, vendettaa said:

Time complexity of 

void fun()

{

   int i, j;

   for (i=1; i<=n; i++)

      for (j=1; j<=log(i); j++)

         printf("afdb");

}

enti idi.. asal em language idi

[budamkayabalraj]

19 minutes ago, vendettaa said:

Time complexity of 

void fun()

{

   int i, j;

   for (i=1; i<=n; i++)

      for (j=1; j<=log(i); j++)

         printf("afdb");

}

n^2 ? because of 2 for loops

[vendettaa]

2 minutes ago, budamkayabalraj said:

n^2 ? because of 2 for loops

google 

[Rushabhi]

GOOGLed O(nlogn) not as easy as it seems