GeeksforGeeks

A computer science portal for geeks

GeeksQuiz

Login

Telephonic: 1. http://www.geeksforgeeks.org/write-c-code-to-determine-if-two-trees-are-identical/ 2. http://www.geeksforgeeks.org/convert-a-given-tree-to-sum-tree/

Read More »

Given two sets represented by two arrays, how to check if the given two sets are disjoint or not? It may be assumed that the given arrays have no duplicates.

Read More »

Round 1 (Online): It had 20 MCQs and 2 coding questions for 90 minutes. Questions were from Operating Systems, Data structures, Aptitude etc. Most of them were exactly same as on www.geeksquiz.com.

Read More »

Round 1: 1. Incoming stream of characters () defines an onion of depth 1, (()) of 2. Find all onions with their in an incoming stream of characters. Discuss complexity.

Read More »

Written round: 1- Given a sorted array.Make a balanced binary tree from this array.

Read More »

Jabong recently visited our campus. About 70 students gave the written test. Here’s my interview experience.

Read More »

I recently got selected in Make my trip . Here is my interview experience.

Read More »

Given an array of jobs where every job has a deadline and associated profit if the job is finished before the deadline.

Read More »

Given two strings X and Y, find the Longest Common Substring of X and Y. Naive [O(N*M2)] and Dynamic Programming [O(N*M)] approaches are already discussed here. In this article, we will discuss a linear time approach to find LCS using suffix tree (The 5th Suffix Tree Application). Here we will build generalized suffix tree for […]

Read More »

In earlier suffix tree articles, we created suffix tree for one string and then we queried that tree for substring check, searching all patterns, longest repeated substring and built suffix array (All linear time operations). There are lots of other problems where multiple strings are involved. e.g. pattern searching in a text file or dictionary, […]

Read More »

A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’ or ‘v’ is in vertex cover.

Read More »

Recently I got interviewed by InfoEdge. It was off-Campus drive at Noida.

Read More »

Given arrival and departure times of all trains that reach a railway station, find the minimum number of platforms required for the railway station so that no train waits.

Read More »

Mode:- skype and telephonic interview written test by:- amcat 1. Recruitment process There was a written test which had four sections. Technical, Logical Reasoning, Quantitative Aptitude, Verbal Ability.

Read More »
Page 1 of 10812345...102030...Last »