GoDaddy Interview Question
Q: Given a binary tree, prove a data structure of your choice is just as efficient Q: Using C/C++, reverse a string using pointers Q: Write a basic parser for any one of the rules given a grammar (specific example I had): S > C A B | D A B A > aA | epsilon B > bA | b C > DAa | epsilon D > Db | CAA
Interview Answer
Anonymous
Sep 27, 2017
Q1: My secret, also might have been wrong Q2: Common question, google Q3: I chose to write a parser for A, since it is the shortest.
1