We strongly recommend to refer below post as a prerequisite of this. K Dimensional Tree | Set 1 (Search and Insert) In this post find minimum is discussed. The operation is to find minimum in the given dimension. This is especially needed in delete operation. For example, consider below KD Tree, if given dimension is… Read More »
Given an integer x, find square root of it. If x is not a perfect square, then return floor(√x). Examples: Input: x = 4 Output: 2 Input: x = 11 Output: 3 We strongly recommend you to minimize your browser and try this yourself first. There can be many ways to solve this problem. For… Read More »
Given an array of jobs with different time requirements. There are K identical assignees available and we are also given how much time an assignee takes to do one unit of job. Find the minimum time to finish all jobs with following constraints. An assignee can be assigned only contiguous jobs. For example, an assignee… Read More »
Accolite Software visited our campus on 31st august 2015. At first, they conducted pre-placement-talk that was the most interesting session i ever attended.
Given an array, how to check if the given array represents a Binary Max-Heap.
It was an on-campus interview. Total 140 students applied for this job and 3 students got the offer letter. There were 4 rounds Round 1: Coding We were given three programs to be completed in 2 hours.one program was difficult and two others were very simple.each program had different weightage Program 1 (highest weightage) Insert… Read More »
Given a linear equation of n variables, find number of non-negative integer solutions of it. For example,let the given equation be “x + 2y = 5″, solutions of this equation are “x = 1, y = 2″, “x = 5, y = 0″ and “x = 1. It may be assumed that all coefficients in… Read More »
FactSet came to our college for recruitment. We were called for PPT. After the PPT was over, everyone was impressed with the presentation. Following the PPT there was a written coding test. After that there were 2 technical interviews and 1 hr interview. Round 1: This was pen and paper round and there were three… Read More »
I attended a Paytm recruitment drive. The requirement was for both Front-end and Backend Developers. I applied for Backend. First there was a written round. The paper consists of 4 Sections. 1- C programming and Data structure objective questions. 2- Aptitude 3- Java / Node JS 4- Subjective programming Question Subjective questions were 1- Print… Read More »
Given a n*n matrix where numbers all numbers are distinct and are distributed from range 1 to n2, find the maximum length path (starting from any cell) such that all cells along the path are increasing order with a difference of 1. We can move in 4 directions from a given cell (i, j), i.e.,… Read More »
Given a stack, sort it using recursion. Use of any loop constructs like while, for..etc is not allowed. We can only use the following ADT functions on Stack S:
We strongly recommend to refer below post as a prerequisite. Hopcroft–Karp Algorithm for Maximum Matching | Set 1 (Introduction) There are few important things to note before we start implementation.
Profiles: TECH ANALYST AND BUSINESS ANALYST Initial->Percentage based shortlisting(>65%) Round1- >Cocubes test consisting of 3 sections: Section1: Questionnaire(What do you know about Axtria,How would you contribute to it etc) and 1 main question->Explain a situation in which you worked in a team and showed your teamwork skills to overcome a problem->20 mins Section2: English(1 rc,fill… Read More »
Written Round There was 2 coding questions conducted on cocubes platform Time limit- 40 mins 1. Find the sum of all non- repeated elements in an array 2. Find the maximum subarray sum such that no two elements are adjacent First technical Interview ( 1 hour): 1. Tell me about Yourself 2. Which language are… Read More »
OFSS visited our campus for recruiting associate application developer . There were 3 rounds in all 1) online test 2) technical interview 3) HR interview 1) Online Test The test broadly consisted of 4 sections – Coding outputs (mainly trees, AVL trees) – English (Grammar,RC) – Computer Science subjects (DBMS,OS,DS) … Read More »
A matching in a Bipartite Graph is a set of the edges chosen in such a way that no two edges share an endpoint. A maximum matching is a matching of maximum size (maximum number of edges). In a maximum matching, if any edge is added to it, it is no longer a matching. There… Read More »
Given a string consisting of opening and closing parenthesis, find length of the longest valid parenthesis substring. Examples: Input : ((() Output : 2 Explanation : () Input: )()()) Output : 4 Explanation: ()() Input: ()(())))) Output: 6 Explanation: ()(())) We strongly recommend you to minimize your browser and try this yourself first. A Simple… Read More »
This article introduces some very basic types of malicious content which may harm your PC in some way or the other.. The Threat The computer systems may become a victim of virus, worm, hacking etc types of attacks. The computer systems may crash, sensitive data can be stolen and misused or driver problems may arise… Read More »
Given a distance ‘dist, count total number of ways to cover the distance with 1, 2 and 3 steps. Examples: Input: n = 3 Output: 4 Below are the four ways 1 step + 1 step + 1 step 1 step + 2 step 2 step + 1 step 3 step Input: n = 4… Read More »