## Count numbers in range such that digits in it and it’s product with q are unequal

Given a range of numbers [l, r] and an integer . The task is to count all such number in the given range such that… Read More »

- Merge Sort
- QuickSort
- Stock Buy Sell to Maximize Profit
- Queue using Stacks
- Ugly Numbers
- Count Possible Decodings of a given Digit Sequence
- Design a stack that supports getMin() in O(1) time and O(1) extra space
- Reverse words in a given string
- Queue | Set 1 (Introduction and Array Implementation)
- Write a function to get the intersection point of two Linked Lists.
- Given a string, find its first non-repeating character
- How to determine if a binary tree is height-balanced?
- Flattening a Linked List
- Check if a given Binary Tree is SumTree
- Sort a stack using recursion
- Puzzle 9 | (Find the fastest 3 horses)
- Convert a given Binary Tree to Doubly Linked List | Set 1
- Number of subarrays having product less than K
- Smallest subarray with sum greater than a given value
- Minimum steps to reach a destination
- Merge two sorted arrays
- Convert a given Binary Tree to Doubly Linked List | Set 3
- Convert a given Binary Tree to Doubly Linked List | Set 4
- Find if two rectangles overlap
- Sort a stack using a temporary stack
- Check if two arrays are equal or not
- Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it?
- Form minimum number from given sequence
- Merge two sorted arrays with O(1) extra space
- Convert a given Binary Tree to Doubly Linked List | Set 2

Given a range of numbers [l, r] and an integer . The task is to count all such number in the given range such that… Read More »

Given a matrix of integers, task is to find out number of positional elements. A positional element is one which is either minimum or maximum… Read More »

Round 1(Online Test): It was an online 1-hour test. It had 9 questions out of which 8 were MCQ questions and one was a coding question. MCQ… 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 »

Round 1: First Round comprises of 1 coding question of 20 marks and 16 MCQs. MCQs was based on stats, probability, data structure, combinatorics etc. … Read More »

Goldman Sachs came to our campus to recruit for internships for Operations profile which is basically the role of a data analyst. Round 1: Round… Read More »

I am student of Computer Science branch. I recently gave interview for Goldman Sachs (Digital interview) for full time New-Analyst post. I want to share… Read More »

Online Round: The online round had two sections CS and quant of 1 hour each. CS section: Interview round 1: Tell me about yourself… Read More »

Round 1: Hackerrank Round It was 2 hr coding round. Both the questions were on matrix. Question 1 : M x N matrix with cell… Read More »

Following are the details of my interview with Goldman Sachs. Round 1: Online Coding Round on Hackerrank (1 hours 30 mins) The online test was… Read More »

Round 1: It was Hackerrank test for 2 hours. Both questions were matrix based Given a matrix consisting of only zeroes and ones.Cell containing 1… Read More »

Recently, GS visited our college during internships to recruit ‘Summer Analysts’ for 2019. Round 1 was an online test hosted on HackerRank. It was composed… Read More »

Goldman Sachs had come to our campus to hire students for both Placements and Internships. This article describes the experience for internships but at the… Read More »

Recently, Goldman Sachs conducted a set of tests in our college in order to select summer interns and I’ll try to note my experience in… Read More »

Problem Statement: Two persons are supposed to meet a spot in a time interval of one hour. The person who comes first will wait for… Read More »