## DE Shaw Interview Experience | Off-campus

I got referred to DE Shaw by my friend and was invited to take their online coding round. Round 1 | Online coding | 70… Read More »

I got referred to DE Shaw by my friend and was invited to take their online coding round. Round 1 | Online coding | 70… Read More »

Given an array arr[] consisting of N integers, the task is to to modify the array such that arr[index] = index using minimum number of… Read More »

Given an undirected and unweighted graph and two nodes as source and destination, the task is to print all the paths of the shortest length… Read More »

Given two arrays arr1[] and arr2[] of N integers. We can choose any two adjacent elements from array arr1[] and swap them if they are… Read More »

Given a binary valued undirected graph with V vertices and E edges, the task is to find the hexadecimal equivalents of all the connected components… Read More »

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time… Read More »

Given a number N, the task is to find the Nth number which has an absolute difference of 1 between every pair of its adjacent… Read More »

Prerequisite: CPU Scheduling in Operating Systems Different Scheduling Algorithms: First Come First Serve CPU Scheduling: Simplest scheduling algorithm that schedules according to arrival times of… Read More »

Given an ancestor matrix mat[n][n] where the ancestor matrix is defined as below. mat[i][j] = 1 if i is ancestor of j mat[i][j] = 0,… Read More »

Given a queue. The task is to reverse the queue using another another empty queue. Examples: Input: queue[] = {1, 2, 3, 4, 5} Output:… Read More »

Pairing Heap is like a simplified form Fibonacci Heap. It also maintains the property of min heap which is parent value is less than its… Read More »

Please see previous articles on Proto Van Emde Boas Tree to understand these properly. Procedure for Insert: Base Case: If the size of Proto-VEB is… Read More »

Hackerrank Test (90 Minutes): They had eligibility criteria of 8 pointers. There were 2 coding questions (15 + 35 Marks) and 5 Computer Science questions… Read More »

Prerequisite – Hashing Introduction, Hashtable using Singly Linked List & Implementing our Own Hash Table with Separate Chaining in Java Implementing hash table using Chaining… 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 »