Marshall Wace | Technology Intern (Intern) | Coding | Onsite

First asked to solve valid parentheses( only parentheses, no curly braces) without a stack. then they said assume there are millions of parentheses that have to be solved across multiple nodes, find an algorithm to solve this. Answer was to use some hadoop algorithm and basically using a net and a max counter thats incremented for ( and decremented for ).