LeetCode
Question
·
Nov 2024
·
San Francisco
Goldman Sachs | Coderpad | Software Engineer Associate
3 upvotes
846 views
3 replies
Question Details
There were 2 DSA problems, 1 easy and 1 medium. Problem 1: Was the same as Josephus Problem, just differenty phrased. Problem 2: Find the root with max nodes in disjoint graphs(trees). A...
Full Details
🔒
Unlock all Goldman Sachs questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a goldman sachs interview for a swe role during the oa round reported in 2024.
It covers the following topics: Binary Tree, Graph, Hash Table, Union Find .
Difficulty rating: Easy