fem-algos

In the course @ThePrimeagen you have explained that the while condition should be and not . But it is wrong, this condition will fail for the edge case where the happens to be the last element. Infact, a guy does ask you the question of why it is not lesser than or equal to and you reply saying it is due to the of the lower bound and of the upper bound and this doesn't make any sense, for me at least. The class link at 4:50 I would have asked it in the discussion section but it has not been enabled for this repo. Please do so, or just share some link to the community groups for this course. Really appreciate it, thanks for your service 🫡

In your lesson on queues you mention that it is mind-boggling that deque is spelled this way, but as a method to remove an item from a queue, it actually should be spelled dequeue as you surmised. Deque would be pronounced "deck" and refers to a double-ended queue data type. https://en.wikipedia.org/wiki/Double-ended_queue

Closes: #4