SAP LABS CAME TO OUR CAMPUS FOR BOTH R&D UNIT BANGALORE AND CONSULTANCY GURGAON. SAP LABS Procedure consists of 6 rounds. 1) ONLINE EXAM 2)… Read More

All Medium Articles

A Binary Heap is a Binary Tree with following properties. 1) It’s a complete tree (All levels are completely filled except possibly the last level… Read More

A K-D Tree(also called as K-Dimensional Tree) is a binary search tree where data in each node is a K-Dimensional point in space. In short,… Read More

Online written 20MCQS + 2 coding question in hacker rank 1. Find the pattern in string (Use Kmp) 2. Rotate matrix by 90. See in… Read More

We have discussed Threaded Binary Tree. The idea of threaded binary trees is to make inorder traversal faster and do it without stack and without… Read More

Serialization is to store tree in a file so that it can be later restored. The structure of tree must be maintained. Deserialization is reading… Read More

Given an n x n matrix, where every row and column is sorted in non-decreasing order. Print all elements of matrix in sorted order. Example:… Read More

IBM ISL On Campus Interview Experience. Round 1: IPAT Online Aptitude Test This online test is timed, with each question allocated its own time limit… Read More

Given an array of integers, find length of the longest subarray which contains numbers that can be arranged in a continuous sequence. In the previous… Read More

1st round(coding): Given a tree, in which leaf nodes for a doubly-linked cycle Print cycle. Tell me if a binary tree is BST? 2nd round(problem… Read More

Given two positive integers n and k, print all increasing sequences of length k such that the elements in every sequence are from first n… Read More

Hello everyone! Cisco came to our campus for full time hiring of final year students. They had shortlisted candidates for the interviews on the basis… Read More

Phonic Interview ********************** 1. Let’s start with you introduction In between introduction he asked me about my some project work experience and How have you… Read More

Which of the following Binary Min Heap operation has the highest time complexity? (A) Inserting an item under the assumption that the heap has capacity… Read More

First Round: 1.Aptitude Questions, basically logical aptitude, Not the standard aptitude questions which we get in other companies, it included some questions of geometry, trigonometry,… Read More

Recently I got the opportunity to be interviewed for the position of MTS-1 at Adobe. Here is my Interview Experience: Written Round: Part A (50… Read More

PROFILE: SOFTWARE ENGINEER PAPER DURATION: 3 hours NO. OF QUESTIONS: 2 (20 marks each) MAXIMUM MARKS: 20*2 = 40 marks QUESTION 1: JSON Prettier:- Write… Read More

Online Round :(Duration – 90 minutes) 20 MCQs to solve and 2 coding questions. 20MCQs were on Algorithms,Data Structures, C Output, Quantitative Aptitude, etc. Coding… Read More

Online Round: An online written round was conducted on mettl.com consisting of following sections: 1. General Aptitude – 15 questions 2. Logical Reasoning – 15… Read More