Accenture Interview Question
I was asked to implement a function to check for balanced parentheses (classic stack problem) and a second, harder one involving finding the lowest common ancestor in a binary tree.
I was asked to implement a function to check for balanced parentheses (classic stack problem) and a second, harder one involving finding the lowest common ancestor in a binary tree.
Check out your Company Bowl for anonymous work chats.