10+ Goldman Sachs Software Developer Interview Questions and Answers

Implement a function to delete a node from a linked list at a specified position.

• Traverse the linked list to find the node at the specified position.

• Update the pointers of the previous and next nodes to skip the node to be deleted.

• Handle edge cases such as deleting the head or tail of the linked list.

• Ensure to free the memory of the deleted node to avoid memory leaks.

Matrix Word Search Problem - Find occurrences of a given word in all eight possible directions within a matrix.

• Iterate through each cell in the matrix and check for the starting character of the word.

• For each occurrence of the starting character, check all eight directions for the complete word.

• Keep track of the coordinates of each character in the word for each occurrence found.

• Ensure boundaries are not crossed while searching in all directions.

• Output the coordinates of each...read more

The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

• Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.

• Keep track of the maximum profit after the first transaction and the maximum profit overall by considering different combinations of buy and sell points.

• Ensure to sell the stock before buying agai...read more

Convert Morse code to alphanumeric code using a predefined table.

• Iterate through the morse code string and convert each morse code to its corresponding alphanumeric character using the given table.

• Join the converted characters to form the final alphanumeric string.

• Handle spaces between morse code characters by adding a space in the final alphanumeric string.

DFS traversal problem to find connected components in an undirected and disconnected graph.

• Use Depth First Search (DFS) algorithm to traverse the graph and find connected components

• Maintain a visited array to keep track of visited vertices

• Iterate through all vertices and perform DFS on unvisited vertices to find connected components

Determine reachability between all pairs of vertices in a directed graph.

• Use Floyd Warshall algorithm to find transitive closure of the graph.

• Initialize a V x V matrix with 1s on the diagonal and 0s elsewhere.

• Update matrix by checking if there is a path from i to j through k.

• Repeat the process for all vertices to get the transitive closure matrix.

Code for rand7 using rand5 function

• Use rand5 twice to generate a number in [1,25] with equal probability

• If the number is greater than 21, discard and try again

• Otherwise, return (number mod 7) + 1

Efficient program to find sum of largest contiguous subarray within a one-dimensional array.

• Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.

• Initialize max_sum and current_sum to 0, iterate through array updating current_sum and max_sum.

• Return max_sum as the result.

Print all nodes at a distance k from a given node in binary tree

• Use Depth First Search (DFS) to traverse the tree

• Maintain a variable to keep track of the distance from the given node

• Print the nodes when the distance is equal to k

Using 8,8,3,3 and only *, /, -, + operators, make 24.

• Start with 8+8=16

• Divide 3 by 3 to get 1

• Multiply 16 by 1 to get 16

• Add 8 to 16 to get 24

Function to randomly select pivot element in Quick Sort

• Generate a random index within the range of the array

• Return the element at the randomly generated index as the pivot

LRU cache is implemented using a doubly linked list and a hash map.

• Create a doubly linked list to keep track of the order of elements in the cache.

• Create a hash map to store the key-value pairs of the cache.

• When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.

• When an element is accessed, move it to the front of the linked list to mark it as the most recently used.

• When an element is remo...read more

Inheritance in Java allows a class to inherit properties and behavior from another class.

• Inheritance allows for code reusability and promotes a hierarchical relationship between classes.

• Subclasses can access the methods and fields of their superclass.

• Example: class Dog extends Animal {} - Dog inherits properties and behavior from Animal class.