Data Structures and Algorithms are one of the most important skills that every computer science student must-have. It is often seen that people with good… Read More »
As the placement season is back so are we to help you ace the interview. We have selected some most commonly asked and must do… Read More »
As the placement season is back so are we to help you ace the interview. We have selected some most commonly asked and must do… Read More »
One of the most common and biggest issue freshers has to deal when they are applying for the job is work experience. In today’s competitive… Read More »
I am Kandula Tarun Reddy solved 4 problems in Codevita 2019.So i was directly called for interview in Hyderabad. There were almost 300-400 students out… Read More »
So i gave tcs ninja on 3rd august, 2019 at t.c.s gitobidhan.I was from slot-2 whose timing was allocated from 11:30 am to 1 pm.So… Read More »
Round 1(screening) Q1. Given a linked list with each node’s data being either a character or whitespace. Reverse the words of the linked list. Input:… Read More »
Deloitte visited our campus (NIT Andhra Pradesh) on 19-8-2019. There were 3 rounds. 1. Aptitude test: Hosted on amcat aspiring minds platform. The test was… Read More »
Amazon has visited our campus (NIT JALANDJAR) for the role of Software Developer Engineer-I (16th August 2019) Process: 1 onilne coding roun+ 4 F2F technical… Read More »
Today was my interview of Sopra Steria in Noida Round 1:It was held on our campus.It is Technical round.They will provide you a link.Then you… Read More »
The m-way search trees are multi-way trees which are generalised versions of binary trees where each node contains multiple elements. In an m-Way tree of… Read More »
Given an array arr[] of integers and a pointer to a random node of a circular sorted linked list (initially empty), the task is to… Read More »
Round 1: It was a 3 hour long online contest and there was only one problem. Question Every point in the universe is represented by… Read More »
The shortlisting for rounds are done by an online test held for approximately 2.5 hrs with 90 questions(MCQ). There are 4 sections, First one has… Read More »
Prerequisite: Hashing | Set 1 (Introduction) What is a Hash Function? A function that converts a given big phone number to a small practical integer… Read More »
Given two integers A and B, the task is to count the number of bits needed to be flipped to convert A to B. Examples:… Read More »
Given an array arr[] of N non-negative integers. The task is to find the right most non zero digit in the product of array elements.… Read More »
Pre-requisite: Introduction to Algorithms The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm… Read More »
