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 full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Binary Tree
Graph
Hash Table
Union Find