Algorithms & Problem Solving - Level 5

Course #13 - Programming Advices Roadmap

Practice-focused course reinforcing data structures through real projects. This marks the completion of Part One of the roadmap.

📚 What's Inside

Data Structures Implemented

Dynamic Array (clsDynamicArray.h)

• Resizable array with automatic memory management
• Operations: Insert, Delete, Find, Reverse, Resize

Doubly Linked List (clsMydblLinkedList.h)

• Bidirectional linked list with efficient insertion/deletion
• Operations: Insert (beginning/end/after), Delete, Find, Reverse

Queue - FIFO

• clsMyQueue.h - Linked list implementation
• clsMyQueueArr.h - Array implementation
• Extended features: Reverse, GetItem, UpdateItem

Stack - LIFO

• clsMyStack.h - Linked list implementation
• clsMyStackArr.h - Array implementation
• Operations: push, pop, top, bottom

Projects

Queue Line Management System (QueueProject/)

• Ticket queue system for service centers (banks, hospitals, etc.)
• Features: Ticket generation, wait time calculation, multiple queues

Undo/Redo System (Undo_Redo_Project/)

• Text editor with undo/redo functionality using stacks
• Demonstrates practical stack usage and state management

📂 Repository Structure

├── clsDynamicArray.h              # Dynamic array
├── clsMydblLinkedList.h           # Doubly linked list
├── clsMyQueue.h                   # Queue (linked list)
├── clsMyQueueArr.h                # Queue (array)
├── clsMyStack.h                   # Stack (linked list)
├── clsMyStackArr.h                # Stack (array)
├── Test_*.cpp                     # Test files
├── QueueProject/                  # Queue management system
│   ├── clsQueueLine.h
│   └── QueueProject.cpp
└── Undo_Redo_Project/             # Undo/Redo system
    ├── clsMyString.h
    └── Undo_Redo.cpp

🎓 Course Info

Course: Algorithms & Problem Solving - Level 5

👨‍💻 Author

Kerolos Hany

• 💼 LinkedIn
• 🐙 GitHub
• ✉️ Email: kerolosxj0@gmail.com

---