Prerequisite: MPI – Distributed Computing made easy Message Passing Interface(MPI) is a library of routines that can be used to create parallel programs in C… Read More »

Given infinte number of elements of form and ( n >= 0 ). The task is to find the minimum count of elements chosen such… Read More »

I got the interview call from GS HR (via Naukri or Some other job portal). The process had 9 rounds, all technical, which took around… Read More »

Given N elements and the task is to implement a stack which removes and returns the maximum frequency element on every pop operation. If there’s… Read More »

Online Assessment Round : Question 1. Given a matrix of 1 & 0. Where 1 is a valid path piece. Given a src and dst… Read More »

Goldman Sachs Interview Experience( 1 year experienced) Round 1: Hackerrank 2 easy questions, with brute force accepted First question was similar to : https://www.geeksforgeeks.org/recursively-remove-adjacent-duplicates-given-string/ Round… Read More »

Given n dices each with m faces, numbered from 1 to m, find the number of ways to get a given sum X. X is… Read More »

Given a string str, the task is to find the number of odd length palindromic sub-sequences around of str with str[i] as centre i.e. every… Read More »

We are going to be looking at the method to close the current tab in a browser window using JavaScript. Earlier it used to happen… Read More »

Given an array arr[] of size N, the task is to generate and print all permutations of the given array. Examples: Input: arr[] = {1,… Read More »

Given an integer N, the task is to find the MDAS factorial. The general factorial of a no. N is given by : Factorial(N) =… Read More »

Round 1:Online Test The Online round was hosted by HackerRank. There was a total of 22 questions. The time given was 1 ½ hours. Every… Read More »

Given two Binary Search Trees(BST), print the elements of both BSTs in sorted form. Note: Both the BSTs will not have any common element. Examples:… Read More »

Given a string, we need to find the minimum number of rotations required to get the same string. In this case, we will only consider… Read More »

Given an array of N elements. Find the subset of elements which has maximum sum such that no two elements in the subset has common… Read More »

Given an array ‘arr’ consisting of integers, the task is to find the non-empty subset such that its sum is closest to zero i.e. absolute… Read More »

Given an integer array which represents the heights of N buildings, the task is to delete N-2 buildings such that the water that can be… Read More »

Given an integer array W[] consisting of weights of the items and some queries consisting of capacity C of knapsack, for each query find maximum… Read More »

Round 1: Coding test -> Codility Three questions were present based on strings, dynamic programming (dp) and graph for 3 hours. Once, qualified was called… Read More »

Given a 2D matrix arr[][] of dimensions N * M where N is number of rows and M is number of columns.The task is to… Read More »