Geeksforgeeks - geeksforgeeks.org
General Information:
Latest News:
[TopTalent.in] Interview with Pradeep Verma from NIT Trichy who talks about his internship at Amazon 27 Aug 2013 | 06:28 pm
Pradeep Verma calls himself just one of those Indian kids but Amazon usually doesn’t recruit every other kid out there. Pradeep did his internship at Amazon last summer and not surprisingly got a full...
Check if all leaves are at same level 27 Aug 2013 | 08:34 am
Given a Binary Tree, check if all leaves are at same level or not. 12 / \ 5 7 / \ 3 1 Leaves are at same level 12 / \ 5 7 / 3 Leaves are Not at same level 12 / 5 / \ 3 9 / / 1 2 Leaves are at [...] T...
Cisco Interview | Set 4 26 Aug 2013 | 09:45 am
Cisco Interview Process: Round 1: 50 MCQs Duration: 1 hr 20 – Math Aptitude. 30 – Technical Technical part included questions from Computer organization, Some problems from OS(finding logical address)...
Amazon Interview | Set 39 (SDE) 25 Aug 2013 | 08:36 pm
I recently attended the walk-in process for Amazon Off campus recruitment drive. This was for SDE position at Chennai. I would like to share my interview experience with Geeks for Geeks. Written Round...
Morgan Stanley Interview | Set 4 25 Aug 2013 | 09:12 am
Written Test: 10 Aptitude 30 Programming 10 CS Fundamentals There’s negative marking, plus there’s sectional cutoff, so you have to be very careful, and risky at the same time. Written Test 2: Program...
Find depth of the deepest odd level leaf node 24 Aug 2013 | 12:31 pm
Write a C code to get the depth of the deepest odd level leaf node in a binary tree. Consider that level starts with 1. Depth of a leaf node is number of nodes on the path from root to leaf (including...
Cisco Interview | Set 3 24 Aug 2013 | 07:11 am
I recently got interviewed for a position in Cisco. The organization came to our college for on-campus recruitment. First round: The first round had 30 technical and 20 easy aptitude questions to be a...
Morgan Stanley Interview | Set 3 23 Aug 2013 | 08:59 am
Morgan Stanley interview experience 1st round: (90 minutes) It was multiple choice questions round. It consists of 3 sections: 1. This section had computer fundamental questions which were easy. It ha...
Print Postorder traversal from given Inorder and Preorder traversals 22 Aug 2013 | 08:24 pm
Given Inorder and Preorder traversals of a binary tree, print Postorder traversal. Example: Input: Inorder traversal in[] = {4, 2, 5, 1, 3, 6} Preorder traversal pre[] = {1, 2, 4, 5, 3, 6} Output: Pos...
NP-Completeness | Set 1 (Introduction) 22 Aug 2013 | 08:59 am
We have been writing about efficient algorithms to solve complex problems, like shortest path, Euler graph, minimum spanning tree, etc. Those were all success stories of algorithm designers. In this p...
