Goldman Sachs Interview Experience | Corporate Treasury – Software Engineering Analyst
Software Engineering AnalystGoldman Sachs SDE Interview Experience
SDE IGS Associate Interview Experience | YOE - 2.3 years
AssociateGoldman Sachs Interview Experience | Analyst | Bangalore
AnalystGoldman Associate Interview Experience
Associate7 more experiences below
Summary
Had a technical interview for the Software Engineering Analyst role at Goldman Sachs. The interview included one coding question involving finding the maximum points path in a grid with specific movement directions. The candidate passed all test cases and completed a dry run.
Full Experience
Goldman Sachs Interview Experience | Corporate Treasury – Software Engineering Analyst
Date: 4 days ago
Experience: 2.7 years
Round: Technical Interview (after HackerRank)
Duration: ~60 minutes (Interview ended in ~45 mins)
Platform: Virtual (Google Meet / Zoom)
🧩 Round Details
The round was scheduled for 60 minutes, but it lasted around 45 minutes.
Surprisingly, I was asked only one main coding question — unlike many other Goldman Sachs interviews I had read about (which usually include two coding questions). no response from recuriter
⚙️ Coding Question (Asked in Interview)
The interviewer shared a problem that involved and kafa related question :
A grid (matrix) containing integer values, where you have to move from a source cell to a destination cell while collecting maximum possible points.
You could move in specific directions (up,right), and the goal was to find the path that collects the maximum points.
all test case pass also done with dry run
Interview Questions (1)
A grid (matrix) containing integer values, where you have to move from a source cell to a destination cell while collecting maximum possible points. You could move in specific directions (up, right), and the goal was to find the path that collects the maximum points.
Summary
I successfully cleared the Software Development Engineer (SDE) interview process at Goldman Sachs, securing an offer after a comprehensive multi-round evaluation. The interview series included an Online Assessment, Coderpad, two DSA rounds (part of a Superday), a Software Engineering round, a System Design round, and a final Hiring Manager discussion.
Full Experience
My journey through the Goldman Sachs SDE interview process was quite extensive, unfolding over several months. It began with an Online Assessment where I tackled two LeetCode medium difficulty DSA problems. This was followed by a Coderpad round, where I faced a graph problem involving virus propagation in a unidirectional, acyclic graph, and a follow-up extending it to multiple initial infection sources.
The Superday consisted of three rounds. The first DSA round presented me with a problem to find the top K tallest buildings from a given list of heights. Another graph problem was asked, which I don't recall precisely, but it was described as a direct LeetCode medium requiring BFS and topological sort concepts, primarily an implementation task. The Software Engineering round delved into my resume, OOPS principles, and different Java HashMap types along with their time complexities. I also encountered a puzzle question and general SDLC practices.
The System Design round focused on designing an LRU cache, alongside further resume-based questions. Finally, the Hiring Manager round was predominantly behavioral, with only a few basic technical inquiries.
I successfully received an offer. The entire process, from initial application to offer letter, took about 2-3 months, with each round's result taking roughly two weeks. Patience is definitely key when interviewing with Goldman Sachs.
Interview Questions (5)
There are some set of people represented as graph (Uni-directional and no cycles). Each person has an ID. Given an ID of a person, that person gets the virus. Return all the set of people who will get the virus.
Follow-up to the previous problem: Instead of one ID, now the initial infected set is a list of IDs. With minimal changes in code, you have to achieve finding all people who will get the virus. The ID here is a unique person/human identifier.
Given a list of building heights, return the top k tallest buildings.
Discuss different Java HashMap types and the time complexity of their operations.
Design a Least Recently Used (LRU) cache.
Preparation Tips
My most significant takeaway from this experience is the critical importance of resume accuracy and depth. For instance, if you mention 'caching' on your resume, even if your experience is limited to a specific type like write-through cache, be prepared to discuss various cache mechanisms, eviction policies, and related concepts comprehensively. It's crucial to know any term you include in your resume inside out, and also to understand the broader concepts surrounding it—aim for at least 80% mastery.
Summary
I recently interviewed for an Associate role at Goldman Sachs, which involved several technical rounds covering data structures, algorithms, system design, and software engineering practices, based on my 2.3 years of experience.
Full Experience
My interview journey for the Associate role at Goldman Sachs consisted of several distinct rounds, meticulously testing my skills in various domains. I'm excited to share the details from my 2.3 years of experience.
Coderpad Round 1
This was my first coding assessment, where I was presented with two DSA questions:
- The first problem was an easier version of a Trie-based question, specifically focusing on implementing
insert(word)andcountWordsStartingWith(prefix)operations. The interviewer referenced this problem for context. - For the second question, I had to find the size of the largest connected component within a forest.
Coderpad Round 2
Following the initial coding round, I faced another set of two DSA challenges:
- I was tasked with implementing a custom class that would support two primary operations:
insert(num)to add a number to the data structure andisTopK(num)to determine if a given number is among the top K most frequent numbers present. - The second question involved finding the first non-repeated character in a string. We then delved into an important discussion about how to adapt this algorithm for very large strings that might not fit entirely into a single machine's RAM.
Software Engineering Practices 1
This round shifted focus towards practical software engineering knowledge:
- I was given a Java code snippet and my task was to identify any issues or bugs present within it.
- The interviewer then probed my understanding of how HashMaps work internally and questioned me on different types of exceptions in Java.
- A significant portion of this round was dedicated to a detailed discussion about my previous projects and contributions.
Software Engineering Practices 2
Building on the previous round, this one also focused on engineering practices, with a specific design challenge:
- I was asked to design a rate limiter. We engaged in a meaningful discussion about various approaches, and I specifically talked about the Leaky Bucket algorithm. Subsequently, I was asked to write a code snippet for its implementation. The discussion also included considerations on how to select appropriate leak rates and bucket sizes for the leaky bucket algorithm.
System Design Round
The final round was entirely dedicated to System Design:
- The discussion began with the Low-Level Design (LLD) of an oversimplified stock market system. This was a purely verbal discussion, with no coding involved.
- We then extended this LLD into a High-Level Design (HLD) for the same stock market, which led to discussions about transactions and locking mechanisms within databases.
- The round concluded with a thorough grilling of my resume, focusing on my experience and technical background.
Interview Questions (11)
Implement a Trie-like data structure that supports two operations: insert(word) to add a word to the trie, and countWordsStartingWith(prefix) to return the number of words in the trie that start with the given prefix. This is described as an easier version of a problem found at algo.monster/liteproblems/1804.
Find the size of the largest connected component in a given forest (a collection of disjoint trees or graphs).
Implement a class with two operations: insert(num) to add a number to the data structure, and isTopK(num) to check if a given number is among the top K most frequent numbers currently in the data structure.
Find the first non-repeated character in a string. Discuss how to extend the algorithm for very large strings that cannot fit into the RAM of a single machine.
Given a code snippet written in Java, identify and explain the issues present within it.
Explain the internal working mechanisms of a HashMap. Also, describe different types of exceptions in Java and when they occur.
A detailed discussion regarding my past projects and technical contributions highlighted in my resume.
Design a rate limiter. Discussed the Leaky Bucket algorithm in detail, including how to select appropriate leak rate and bucket size. I was then asked to write a code snippet implementing the Leaky Bucket algorithm.
Verbal discussion focusing on the Low-Level Design (LLD) of an oversimplified stock market system, without any coding required.
Extend the Low-Level Design of the simplified stock market to a High-Level Design (HLD). This involved discussions about transactions and locking mechanisms within the database.
An in-depth review and questioning based on my resume and professional experience.
Summary
I recently interviewed with Goldman Sachs for an Analyst role in Bangalore, navigating through an Online Assessment, a CoderPad screening, and a comprehensive Superday that included multiple Data Structures & Algorithms rounds, a Low-Level Design challenge, and a Behavioral/HR interview.
Full Experience
My interview journey with Goldman Sachs for an Analyst position in Bangalore started with an Online Assessment (OA) conducted on Hackerrank. This assessment primarily tested my fundamental coding skills with problems focused on arrays, strings, and understanding time/space complexity.
Following the OA, I proceeded to a CoderPad Screening. This was a live coding session designed to evaluate my problem-solving speed, code correctness, and clarity of thought. During this round, I was asked to solve two distinct problems: Find the Length of Cycle in an Array and Number of Islands. For the 'Number of Islands' problem, the interviewer specifically guided me to use BFS over DFS, emphasizing its advantage in avoiding potential stack overflow issues.
The final and most intensive stage was the Superday, which comprised four consecutive rounds.
- Round 1 – Data Structures & Algorithms (DSA): My first DSA round presented two challenges. One involved finding the Minimum Characters to Remove from the left, right, or both ends to make a string palindrome. The second was a Binary Search Assignment, which felt very similar in concept to the popular 'Koko Eating Bananas' problem.
- Round 2 – Data Structures & Algorithms (DSA): In the second DSA round, I tackled the classic Coin Change problem, where I had to find the minimum number of coins required to make a specific amount. Additionally, I was given the Container With Most Water problem, which came with an intriguing follow-up question: 'what if the container is tilted?'
- Round 3 – Low-Level Design (LLD): This round shifted focus to design principles. I was tasked with designing a Traffic Light System that could dynamically adjust its wait times based on real-time traffic data, requiring me to consider various system components and interactions.
- Round 4 – Behavioural / HR: The last round was a standard behavioral and HR interview. We discussed my past projects, examples of ownership and challenges I've faced, how I handle tight deadlines and conflicts, and my overall motivation and career goals. A particularly interesting scenario-based question was posed: 'You overhear in a lift that a colleague, who was expecting a salary hike, is actually not going to get one. How would you handle this situation while maintaining professionalism and confidentiality?'
Interview Questions (8)
Find the length of a cycle present in a given array.
Given a 2D grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. The interviewer preferred BFS over DFS to avoid stack overflow.
Determine the minimum number of characters to remove from the left, right, or both ends of a given string to make it a palindrome.
A problem similar to 'Koko Eating Bananas', which typically involves finding a minimum or maximum value within a range where the condition is monotonic, making binary search applicable.
Given an array of coin denominations and a target amount, find the minimum number of coins needed to make up that amount.
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which, together with x-axis forms a container, such that the container contains the most water. Follow-up: What if the container is tilted?
Design a Traffic Light System that dynamically adjusts wait times based on real-time traffic data, considering factors like sensor input, traffic flow prediction, and synchronization between intersections.
Scenario: You overhear in a lift that a colleague, who was expecting a salary hike, is actually not going to get one. How would you handle this situation while maintaining professionalism and confidentiality?
Preparation Tips
My preparation for these interviews primarily involved a thorough revision of core Data Structures and Algorithms topics, including BFS/DFS, Dynamic Programming (DP), two-pointer techniques, binary search, and various string manipulation algorithms. I focused not just on solving problems, but also on clearly communicating my logic and walking through examples step-by-step. For the Low-Level Design round, my strategy was to concentrate on designing systems that were simple, scalable, and where I could clearly articulate the trade-offs involved in different architectural choices. For the Behavioral/HR rounds, I diligently prepared structured stories using the STAR method to effectively highlight instances of my ownership, teamwork, and problem-solving skills.
Summary
I interviewed for an Associate position at Goldman Sachs, undergoing an Online Assessment, CoderPad, and four onsite rounds that included DSA, Java concurrency, SQL, and System Design problems. Despite my efforts, I was ultimately rejected after the final System Design round.
Full Experience
I applied for an Associate role at Goldman Sachs via a referral. My interview journey began with an Online Assessment, which consisted of two medium LeetCode questions. Following that, I had a CoderPad round where I tackled a Trie-based question and a simple DFS problem, all within an hour using C++. The main interview process involved four subsequent rounds. Round 1, focused on DSA, included some resume-based questions, a DSA problem based on hashmaps, and a Binary Search Tree question combined with two pointers. Round 2 delved into more resume-based discussions, a Java concurrency problem, SQL questions, and another LeetCode medium DSA question. Round 3 was a System Design interview where I was asked to design a high-level upload portal for internal users. The final round, lasting 30 minutes, centered on a parking lot problem, specifically how to efficiently calculate prices given varying strategies for weekdays, weekends, and specific hours (like 9 AM - 5 AM). This last round, unfortunately, led to my rejection; I found the interviewer somewhat unresponsive when I sought clarifications.
Interview Questions (2)
Design a High-Level Design (HLD) for an upload portal intended for internal users.
Design a system focused on how to efficiently calculate parking prices if we have different pricing strategies based on weekdays and weekends, and also consider specific hours (e.g., 9 AM - 5 AM).
Summary
I interviewed for an Associate position at Goldman Sachs in Bangalore in August 2025 and received an offer after successfully navigating a comprehensive interview process that included online assessments, multiple technical DSA and system design rounds, and a final hiring manager discussion.
Full Experience
I recently went through the interview process for an Associate position at Goldman Sachs in Bangalore, which spanned from June to August 2025. The process was conducted online and consisted of an Online Assessment followed by four technical rounds, and finally a Hiring Manager round. I have 3 years of experience.
Online Assessment
The online assessment included 2 LeetCode-style questions: one easy and one medium, which focused heavily on time complexity. I successfully cleared this stage and received an invitation for the interviews within approximately three days.
Round 1 (Technical DSA ~1 hour)
In this round, I was asked to solve two DSA questions by coding on a shared editor. The first problem required converting a fraction string (e.g., "2/5" or "-2/5") into its decimal representation, including handling recurring decimals like "0.(6)" for "2/3". The second question was an easy-medium linked list problem, which I don't fully recall, but I successfully passed all the provided test cases. After two weeks, I received an email inviting me to the Superday rounds.
Superday Round 1 (DSA ~1 hour)
This round involved two DSA questions. The first question was to check if a string has a cycle, for which I had to write optimized code. The second question was to build a calculator, given an expression string like "(2*5+7)", and return the evaluated integer. The interviewer specified that it could include brackets, so I had to parse the expression and correctly handle operator precedence. I was able to solve both questions.
Superday Round 2 (DSA + System Design Lite)
This round combined DSA and a light system design component. The DSA question involved a 2D array: finding the maximum value path when travelling only diagonally up, diagonally down, or right. I explained a recursive approach first and then implemented an optimized solution, followed by discussing variations if movement directions changed. The data structures question asked me to design a structure for efficiently querying if at least two different customers visited the same store on a given day from a log file. I proposed a solution using a Map and Set, and we discussed follow-ups on implementing it with a database and the trade-offs between space and query efficiency.
Superday Round 3 (System Design – Twitter Clone)
This was a dedicated system design round where I had to design Twitter. The first half focused on Low-Level Design (LLD), detailing classes and models for Users, Tweets, and Follows. The second half shifted to High-Level Design (HLD) with an emphasis on scalability, particularly how to notify millions of users simultaneously. The discussion covered various topics like queues, database usage, caching strategies, scaling, microservices, and Kafka.
Superday Round 4 (Hiring Manager)
The final round was with the Hiring Manager. We had a deep dive into the architecture of my most recent project. I also answered questions on Agile methodology, including its pros and cons, and how I handle sprint delays. Leadership and situational questions were posed, such as how I would handle team conflicts and prioritize features against deadlines.
I successfully cleared all rounds and received an offer call for the Associate position an hour after my last Superday interview.
Interview Questions (7)
Given a string representing a fraction, for example, "2/5", return its decimal representation. The fraction can also be negative, like "-2/5". The output should handle recurring decimals, such as "2/3" which returns "0.(6)".
Given a string representing an arithmetic expression, such as "(2*5+7)", evaluate it and return the integer result. The expression can include integers, basic arithmetic operators (+, -, *, /), and parentheses, requiring parsing and handling operator precedence.
Given a 2D array, find the maximum value path sum where movement is restricted to diagonally up, diagonally down, or right. I initially approached this with recursion and then optimized it. There were also follow-up questions regarding changes in allowed movement directions.
Given a log file detailing store visits, design a data structure that can efficiently answer queries to determine if at least two different customers visited the same store on a specific day. Follow-up discussions included alternative implementations using databases and an analysis of trade-offs between space complexity and query efficiency.
The task was to design Twitter. The first half focused on Low-Level Design (LLD), including defining classes and models for Users, Tweets, and Follows. The second half covered High-Level Design (HLD) concerning scalability, specifically how to efficiently notify millions of users simultaneously. This involved discussions on various system components like queues, database usage, caching strategies, scaling, microservices architecture, and Kafka.
Discussion revolved around Agile methodology, including its pros and cons, and strategies for handling sprint delays or impediments.
Situational and leadership-focused questions were asked, such as how I would handle conflicts within a team and how I prioritize features against tight deadlines.
Summary
I had a Coderpad round for an Analyst position at Goldman Sachs where I was able to solve two algorithmic questions, though I received some hints on the second one. The verdict is still pending.
Full Experience
I joined the Coderpad round for an Analyst position at Goldman Sachs. The interviewer started right on time with introductions. I was asked two specific questions. I managed to solve both of them. For the second question, the interviewer provided a couple of hints when I was heading in the wrong direction, which I thankfully picked up and used to solve the problem. I am currently awaiting the final verdict.
Interview Questions (2)
Given a string, find all the unique substrings of a specified length 'len'. As a follow-up, I was asked to handle multiple edge cases through exception handling.
Given a forest (one or more disconnected trees), find the root of the largest tree and return its Id. If there are multiple such roots, return the smallest Id among them. I was provided with a map immediateParent, containing key-value pairs indicating child -> parent relationship. The key is the child and the value is its corresponding immediate parent.
Constraints:
- Child cannot have more than one immediate parent.
- Parent can have more than one immediate child.
- The given key-value pair forms a well-formed forest (a tree of n nodes will have n-1 edges).
Input:
{ { 1 -> 2 }, { 3 -> 4 } }Expected output:
2Summary
I interviewed for an Associate Data Engineer role at Goldman Sachs with 3 years of experience. The process involved a HackerRank assessment, a CoderPad round, and a multi-round Super Day, but I was unfortunately rejected after the second round of the Super Day.
Full Experience
A recruiter reached out to me for a Data Engineer (Hadoop/Spark) Associate position, given my 3 years of experience. The interview process began with a HackerRank round, followed by a CoderPad round. The final stage was a Super Day, which comprised multiple elimination rounds. Despite making it to the Super Day, I was ultimately rejected after the second round, as I didn't perform as well as required.
Interview Questions (5)
Given a list of child-parent relations representing trees in a forest, I needed to determine the number of unconnected trees. Additionally, I had to identify the root of the tree that contained the maximum number of children. A Depth-First Search (DFS) approach was suggested.
I was given a sorted array of numbers and an integer value k. My task was to increment any number(s) in the array, using a total of at most k increments. The objective was to find the maximum number of identical elements that could be achieved in the array after these operations. A sliding window technique was hinted at.
Given an array of tasks, a CPU can process one task per cycle. However, similar tasks must be performed after a k cooling period cycles. I needed to determine the minimum CPU cycles required to complete all tasks. The problem statement suggested using a Heap or a Queue.
I was asked to implement a Time-To-Live (TTL) based cache. This involved designing a cache mechanism where key-value pairs would automatically expire after a specified duration.
I needed to design a Notification System at a Low-Level Design (LLD) level. The focus was on defining the classes, their relationships, and incorporating appropriate design patterns to build a robust and scalable system.
Summary
I interviewed with Goldman Sachs for an Associate role, undergoing an Online Assessment, two coding rounds, and a Super Day comprising DSA, Low-Level Design, and High-Level Design rounds. Despite performing well in coding and some DSA, I was ultimately rejected after struggling in the High-Level Design round.
Full Experience
I applied directly on the Goldman Sachs portal, and soon after, a recruiter contacted me, providing a HackerRank test link for the first round.
1st Round - Online Assessment
This round consisted of two medium-difficulty questions. I successfully cleared this round and was invited for the next.
2nd Round - Coding (Codepad)
In this round, the interviewer presented two coding challenges. I was expected to provide the most optimal code. I successfully solved both problems, and all test cases passed within 30 minutes. This performance led to my selection for the Super Day.
Super Day Rounds
A week later, I participated in the Super Day, which involved three rounds conducted on the same day.
1st Round (DSA)
There were two interviewers in this round, each asking one question. I was able to partially solve the first design question but fully completed the second array problem with all test cases passing.
2nd Round (Low-Level Design)
This round began with discussions about my projects, followed by questions on NoSQL and SQL databases. I was then asked to design a system for a restaurant to track its most frequently ordered items. Additionally, there were Java-specific questions covering topics like the static keyword, garbage collection, and multithreading.
3rd Round (High-Level Design)
The final round involved designing a monitoring tool. Unfortunately, I struggled significantly in this round, partly because I felt my previous LLD round hadn't gone well, and I found myself unable to articulate a comprehensive solution.
Verdict
Ultimately, I was rejected after the Super Day rounds.
Interview Questions (6)
Find the first non-repeating character in a string and return its index. If no such character exists, return -1.
Find the integer in a rotated sorted array. The array was originally sorted in ascending order but was rotated at some unknown pivot point.
Design a data structure that supports three operations: updating a specific value, returning a specific value, and changing all values currently in the data structure, all with O(1) time complexity.
Given an array and an integer k, you can only take values either from the front or the back of the array. The goal is to output the maximum sum achievable by taking exactly k values.
Design a system for a restaurant to track and identify its most frequently ordered items. The design should consider data structures, APIs, and overall system architecture for a low-level implementation.
Design a high-level architecture for a generic monitoring tool. Consider aspects like data collection, storage, visualization, alerting, and scalability.
Summary
I recently interviewed at Goldman Sachs for an SDEII position in Birmingham, where I encountered a specific Data Structures & Algorithms question.
Full Experience
During my interview process for the SDEII role at Goldman Sachs in Birmingham, I was asked to solve a coding problem. I also noted a link to another LeetCode discuss post which might contain further details about a different problem.
Interview Questions (1)
Given an array of integers, find the second smallest element. The solution should achieve an O(n) time complexity.
Summary
I recently interviewed for an Associate role at Goldman Sachs. The process involved three rounds focusing on DSA and JavaScript. Unfortunately, I was rejected after failing to perform well in the second DSA round.
Full Experience
I was reached out by a recruiter for an Associate position with a frontend (React) focus. I have 3 years of experience in product-based companies.
Round 1 (DSA)
This round focused on Data Structures and Algorithms.
- I was asked to find the second largest number in an array.
- The second problem involved processing a 2D array of
[name, marks]. My task was to group marks by name, compute the average for each name, and then return the maximum average among all names.
Round 2 (DSA)
The second DSA round proved to be challenging for me.
- The first problem was Search in Rotated Sorted Array.
- The second problem was Find the Kth Largest Integer in the Array.
I didn't perform well in this round, which ultimately led to my rejection.
Round 3 (Javascript)
This round was focused on JavaScript concepts.
- There was a discussion around
reduce,filter, and the spread operator. - I was specifically asked to flatten a 2D array using the
reducemethod. - There was also a complex JavaScript problem involving both
reduceandfilter, though I don't recall the exact specifics.
I received a rejection verdict, primarily due to my performance in Round 2.
Interview Questions (5)
Given an array of numbers, find the second largest number in it.
You are given a 2D array of [name, marks]. You need to group marks by name, compute the average per name, and return the maximum average among all names.
Demonstrate how to flatten a 2D array using the reduce method in JavaScript.
Summary
I recently interviewed at Goldman Sachs for an Engineering Associate position, undergoing a virtual panel with three rounds covering algorithms, system design, and behavioral questions. I successfully advanced to the "Bar Raiser" round.
Full Experience
This virtual panel interview for an Associate position at Goldman Sachs was a follow-up to my CoderPad interview. The day consisted of three separate rounds, each lasting about 60 minutes, all conducted on the same day.
Round 1: Algo & Data Structures
The first round began with interviewers asking several common Core Java questions related to data structures such as Lists, Sets, and HashMaps. Following this, I was given two coding problems to solve: first, implementing a HashMap from scratch, and second, finding the length of the Longest Increasing Subsequence. There was a minor hiccup as the interviewers expected me to code in Java, but I clarified that I had opted for Python during the recruiter's initial query.
Round 2: Software Design and Architecture
This round started with a brief discussion about the High-level Design of a significant project I had worked on at my previous company. Afterward, we transitioned into a discussion about the High-Level Design (HLD) for a URL Shortener website, similar to tinyurl. The focus was purely on discussing trade-offs and architectural considerations, without the need for any diagrams.
Round 3: SDLC & Resume
The final round was quite relaxed, feeling more like a casual conversation with colleagues. The interviewers thoroughly reviewed my resume, asking detailed questions about my past experiences and responsibilities. We also discussed various Software Engineering practices, including how I approach creating JIRA tickets. Overall, it was a very chill experience and not as intimidating as it initially seemed.
Super Day Verdict: I advanced to the "Bar Raiser" round!
Interview Questions (2)
Find the length of the longest increasing subsequence in a given array.
Design a high-level architecture for a URL Shortener service similar to tinyurl. Discussion should cover trade-offs.