Recursion and Regex in Build a Time Calculator Project

Hello fellow coders,
I successfully completed the Build a Time Calculator Project, however my code did not contain any recursion or regex or merge sort. I am wondering if I am missing these concepts as the last few projects covered these topics.

Here is a flowchart of my code (Click to enlarge, and click again to enable horizontal scroll):

Have you used recursion or regex or merge sort your code for this project? If so, can you please direct me to how I can implement these techniques and improve my code?

Thanks in advance!

if your code works, then you used the correct tools. regex could be used but is not necessary (any time you need to check what is inside a string you could use regex). Recursion could be used but imo would make things unnecessary more complex. I don’t see any reason to use a merge sort algorithm here.

Thanks so much for you input! :smile:

Initially when I was thinking about the problem and designing the algorithm, I tried to keep the solution simple and ended up not using the things I just learned. Somehow I ended up getting imposter syndrome anyways!