Can You Solve This Google Coding Interview Question??

preview_player
Показать описание
Solution to a very popular coding interview question asked recently by Google - Symmetric Tree.

#softwareengineering #javascript #shorts

Music:
Creative Commons / Attribution 3.0 Unported License (CC BY 3.0)
Рекомендации по теме
Комментарии
Автор

Clearly explained. Please make more videos on trees. Thank you.

rahulmehra
Автор

I thought about dfs for both and comparing each node. Both solutions are O(n)

BenOri-vgle
Автор

Very simple question . A simple recursive approach does the work .

TheBackendDeveloper-bt
Автор

Identical as sets or identical as trees? There's a huge difference

vafasadrif
Автор

Yep guessed it right. This was kinda easy ngl

madeinhvn
Автор

I get the same solution by using recursion 😊 but I’m asking if we could do it iteratively through 😂

ahmatmhtlouky
Автор

Is this the algo to compare two objects?😅😅

thedelanyo
Автор

How does !p && !q means they're since you're returning true?!!

shs
Автор

JSON.stringify(tree1) === JSON.stringify(tree2)

WiggleYoJiggle