Going from easiest to hardest in my Ds & Algos prep I moved onto Binary search trees. Starting with Breath First Search (BFS). BFS is pretty easy to implement in JS with arrays as queues. Enjoying getting a few more leetcodes right today!
Later tonight I will push myself to add some functionality to my openAI cover letter app. Users have been asking for reply functionality. I.e. if the application asks you another question to answer – not just a cover letter. Watch this space!
Have a great weekend everyone 😊
