I only know about the telephonic interview round which was of around 30 minutes. They asked three algorithmic problems, 1. For a given binary tree where each node has a integer value associated with it. Write a program that takes k as input and prints the sum of all nodes after level k. 2. Algorithm/program for rotating a string k times. 3. Some problem related to Josephus problem
Then they asked some basic questions on C/C++ On Aug 6, 1:48 pm, vicky S <vickyaspir...@gmail.com> wrote: > Any one know how the global scholar written round will be ? whether they > concentrate on OOPs language lik C++ Java or c aptitudes itself enough ? how > wil be the next techinical rounds ? > Thanks in adcance :) -- 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 http://groups.google.com/group/algogeeks?hl=en.
