core data structures in C++

Over the past few weeks, I challenged myself to go beyond textbook learning and replicate core data structures in C++ without using the STL. The result? 📦 A full project repository — MyDataStructures — implementing:
🔹 MyString (custom version of std::string)
🔹 MyLinkedList (singly linked list with dynamic ops)
🔹 MyStack (stack using linked list)
🔹 MyQueue (queue using linked list)

📂 Check it out here: https://lnkd.in/dTEnUzMe

🛠️ What makes this project special?
✅ Built 100% from scratch — no STL
✅ Deep use of dynamic memory allocation
✅ Move semantics, operator overloading, RAII
✅ Proper separation of concerns via .h and .cpp files
✅ Manual implementation of common operations: insert, delete, traverse, search, etc.
✅ Clean, testable code with beginner-friendly comments and structure

💡 Why I built this:
As someone aiming to grow into a FAANG-level software engineering role, I believe understanding how things work under the hood is just as important as using frameworks. This project is my deep dive into low-level programming, memory safety, and STL replication, helping sharpen my skills for systems programming and algorithm-heavy interviews.

🔁 Feedback, suggestions, and stars are most welcome!