Acquire the source code.
$ git clone https://github.com/vighneshvnkt/data-ductus-challenge.git
$ cd data-ductus-challenge
$ python ParanthesisTreePrinter.py
You will get a prompt to submit input string. Once you submit it, you will see the printed output and the program exits.
PROMPT:
Given a string as input, your task is to write a program which parses the string and prints it out as a horizontal tree.
If the string input is invalid, your program should print, "Invalid!" and exit.
- Individual elements are delimited with a comma followed by space (e.g., ", ")
- Individual groupings are designated with an open bracket [ and a close bracket ]
- Your program should accomplish this task in the most efficient way possible.
- Empty elements are valid.
EXAMPLE 1 (Input):
[1, 2, [A, B, C, [5^&, )()6, , 7], D, E], 3, 4]
EXAMPLE 1 (Output):
1
2
A
B
C
5^&
)()6
7
D
E
3
4
EXAMPLE 2 (Input):
[1, 2, [A, B, C, [5, 6]]
EXAMPLE 2 (Output):
Invalid!
Strings are split at ", " and there are no commas inside each element in the string array after splitting </br>
If there is a comma, return Invalid.
O(3N) ~ O(N) where N is the size of the input string
First for loop is to check for equal parantheses
Second for loop is to ensure there are no commas in each element of string array after splitting
Third for loop is for printing the required output
O(S + I) ~ O(I) where S is the size of paranthesesStack and I is the size of array after splitting input string
Additional space is required for selecting substrings from elements in string array
eg: string = "Apple" and string[:3] returns a new string containing chars from index 0 to 2