## Goldman Sachs Interview Question for Software Engineer / Developers

• 0

Country: India
Interview Type: In-Person

Comment hidden because of low score. Click to expand.
0
of 0 vote

Seems like.. this problem can be achieved through Composite Design Pattern

Comment hidden because of low score. Click to expand.
0
of 0 vote

Seems like ....using composite design pattern, this problem can be solved

Comment hidden because of low score. Click to expand.
-1
of 1 vote

let's have a graph, where one vertex corresponds to one rectangle. Let's draw an edge from vertex A to B iff corresponding rectangle to B is inside rectangle corresponding to A. After this procedure we end up having DAG (directed acyclic graph). Run dfs(X) on it, to find number of vertexes in subtree rooted at X.

Completexity - O(n + m)
Memory - O(n + m)
where, n and m - number of vertices and edges in graph correspondingly

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.