Skip to content

Tag Archives: Goldman Sachs

Given two rectangles, find if the given two rectangles overlap or not.Note that a rectangle can be represented by two coordinates, top left and bottom… Read More
Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as… Read More
Like Stack, Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO).… Read More
Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot.… Read More
Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL). The left and right pointers in nodes are to be used as previous… Read More
Super Day Process 1st Round – Written test to be completed in 1hour 20 mins containing questions on C++, SQL and Aptitude questions. The questions… Read More
Given a Binary Tree (Bt), convert it to a Doubly Linked List(DLL). The left and right pointers in nodes are to be used as previous… Read More
Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and… Read More
Goldman Sachs is well known for their lengthy interview process. There’s no denying it. GS interview process is really, really tough but it’s certainly not… Read More
Written test: It comprised three papers that were held back to back and took approximately three hours. The first two papers were subjective. First one… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type: (i) Pointer to next node in the main… Read More
  Write a function to check whether two given strings are anagram of each other or not. An anagram of a string is another string… Read More
Given an array of integers which is initially increasing and then decreasing, find the maximum value in the array. Examples :   Input: arr[] = {8, 10,… Read More