Goldman Sachs | Software Engineer/Analyst | Hyderabad | 2021 | Offer Accepted

Given an array of integers, find the number of subsequences of length 3 that form a Geometric Progression (GP). A subsequence is formed by deleting zero or more elements from the original array. For example, if the array is [1, 2, 4, 8], [1, 2, 4] and [2, 4, 8] are GP subsequences.

There are n soldiers standing in a line. Each soldier is assigned a unique rating value. You have to form a team of 3 soldiers amongst them such that their ratings are either strictly increasing or strictly decreasing (i.e., (rating[i] < rating[j] < rating[k]) or (rating[i] > rating[j] > rating[k])) with indices (i < j < k).

Given the root of a binary tree, return the maximum sum of values of nodes such that no two nodes are adjacent. Two nodes are adjacent if one is the parent of the other.

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. You can only move either down or right at any point in time.

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) initializes the LRU cache with the given positive capacity. int get(int key) returns the value of the key if the key exists, otherwise returns -1. void put(int key, int value) updates the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key.

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window.

Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where encoded_string inside the square brackets is being repeated k times. k is guaranteed to be a positive integer.

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. I was specifically asked to solve this with O(1) space complexity and O(n) time complexity.

Given a list of positive integers representing coin denominations, find the smallest positive integer amount that cannot be formed by summing any subset of the given coins.

Given a boolean expression string consisting of 'T' (True), 'F' (False), 'AND' (&), 'OR' (|), and 'XOR' (^) operators, count the number of ways to parenthesize the expression such that it evaluates to True. For example, 'T|F&T' can be parenthesized as ((T|F)&T) -> (T&T) -> T, or (T|(F&T)) -> (T|F) -> T.

You are given an array prices where prices[i] is the price of a given stock on the i^th day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

The n-queens puzzle is the problem of placing n non-attacking queens on an n×n chessboard. Given an integer n, return all distinct solutions to the n-queens puzzle.

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

I was asked to design a web application that supports multiple languages, including detailing the entire application flow.