Round 1: Q1. Given a tree's root node as input, return a List, of the leaf nodes. Example input: root (1) -- leftnode (2) root (1) -- rightnode (3) node (2) -- leftnode (4) node (2) -- rightnode (5) node (3) -- leftnode (6) Expected output: 4 5 6 2 3 1 Q2. Given a string of alphabets along with the special character "#". "#" represents a backspace action. For the given input string return the resultant output after performing the backspace actions as needed. Examples: INPUT: A#B OUTPUT: B INPUT # OUTPUT INPUT A## OUTPUT INPUT ABC# OUTPUT AB

Question

Round 1: Q1. Given a tree's root node as input, return a List>, of the leaf nodes. Example input: root (1) --> leftnode (2) root (1) --> rightnode (3) node (2) --> leftnode (4) node (2) --> rightnode (5) node (3) --> leftnode (6) Expected output: 4 5 6 2 3 1 Q2. Given a string of alphabets along with the special character "#". "#" represents a backspace action. For the given input string return the resultant output after performing the backspace actions as needed. Examples: INPUT: A#B OUTPUT: B INPUT # OUTPUT INPUT A## OUTPUT INPUT ABC# OUTPUT AB

Informatica

Sollicitatievraag bij Informatica

Gevolgde bedrijven

Vacatures