Goldman Sachs Interview Experience

First Round

i was asked one dsa question which is zigzag conversion of string https://leetcode.com/problems/zigzag-conversion/

Second Round

Question 1

A Node is defined as a directory or file. If its a directory it can have sub-directories and files inside it. Write a function `deleteNode` which deletes the node and its childern recursively Given to you three functions/methods

1. isDirectory which returns if the node is a directory or not
2. getChildren if the node is a directory, and not empty returns all the contents inside it
3. delete deletes the node if its a file or if an empty directory

Question 2

I was asked to implement queue using stack you can find the solution here

Question 3

Given a Sorted Linked list, convert it into a balanced BST

Question 4

Given stock prices for n days, find the maximum profit that can be earned by buying and selling.