What is the time and space complexity of Deep Equal?

Time complexity: O(n) where n is the total number of nested properties. Space complexity: O(d) where d is the nesting depth.

Deep Equal

Med

Code

Loading editor...

Tap Analyze to see visualization

Click Analyze to visualize

See step-by-step execution, variables, and output

Variables

Run code to see variables

Output

Console output will appear here

Press Space to start•← → to step•? all shortcuts

Solution Guide: Deep Equal

Approach

Recursively compare two values. First check strict equality for primitives and same-reference objects. Then verify both are objects of the same type with the same number of keys. Finally, recursively compare each key's value in both objects.

Complexity Analysis

Time: O(n) where n is the total number of nested properties
Space: O(d) where d is the nesting depth

Pattern

Deep Equality Check

Why It Works

Short-circuiting on strict equality handles primitives and shared references in O(1), while recursive key-by-key comparison catches structural differences at any depth.

Updated Mar 2026