All Medium Articles
Amazon visited our campus, these are the questions that I faced. Online Round (90 minutes)Become a success story instead of just reading about them. Prepare… Read More
Recently Morgan Stanley visited our campus for jobs and interns. I had applied for the position of an intern and there were two rounds for… Read More
Recently D.E Shaw visited our campus for internship and placements. They shortlisted 16 students out of 200 students on the basis of resume. Telephonic Interview… Read More
Left-Right representation of a binary tree is standard representation where every node has a pointer to left child and another pointer to right child.Down-Right representation… Read More
I took Coding Round 1 of Direct I campus recruitment today. Sharing the 2 questions which have been asked. Question 1 (Optimal substring reversal): You… Read More
Written round: 5 coding and 15 MCQ on ds, algos, dbms. Round 1 Tell me about yourself Given two strings str1 and str2 find if… Read More
Online round: 20 MCQs on mathematics, probability, operating systems, DBMS, compilers and basic DS concepts. Coding questions (Full code required): 1. Given an array containing… Read More
First of all, I would like to convey my special thanks to geeksforgeeks for such a special guidance. Here is my interview experience: First day:… Read More
Status: Full Time job + 6 month internship offered. It was a 4 round interview. The first round was a written round with 50 questions(20… Read More
You are given a string that represent an expression of digits and operands. E.g. 1+2*3, 1-2+4. You need to evaluate the string or the expression.… Read More
D. E. Shaw recently carried out intern procedure in our college. The whole process had three rounds. Round 1: It was CV shortlisting. Out of… Read More
We can use binary search to reduce the number of comparisons in normal insertion sort. Binary Insertion Sort find use binary search to find the… Read More
Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the… Read More
Given two binary trees, check if the first tree is subtree of the second one. A subtree of a tree T is a tree S… Read More
Given a radius of a circle, draw the circle without using floating point arithmetic.Following program uses a simple concept. Let the radius of the circle… Read More
Predict the output of the following C program. Take a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List… Read More
Output of following program?Take a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many more! Check… Read More
Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] and its permutations (or… Read More
Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] and its permutations (or… Read More
Given two sorted arrays, such that the arrays may have some common elements. Find the sum of the maximum sum path to reach from the… Read More