Away for Easter and took some Data Structures and Algorithm books to read since most interview loops have coding challenges. Decided to leave the classics at home to instead find new insights. Not only do none of these talk about Double-Ended Queues, one even says don’t consider them because finding tail is O(n) 🤦

Интересный выбор литературы! Важно быть готовым ко всему в интервью. Может быть, новые идеи принесут свежий взгляд на проблемы. Удачи в изучении! 📚✨