Locked

Pass the Dictionary check first

Everything after it builds on dictionaries. Each rep in the check has to be passed without opening the solution. Hints and Basics are fine.

Still to clear · 8 of 8

Continue the check

Preview · where this ladder is heading

Same Tree

Given the roots of two binary trees, decide whether they are identical: the same shape, with equal values in every matching position. Return True or False.

inp = [1, 2, 3], q = [1, 2, 3]outTrue
inp = [1, 2], q = [1, None, 2]outFalse
inp = [1, 2, 1], q = [1, 1, 2]outFalse

You can read it now. The editor opens when the check is cleared.