Algorithmic Interview Problems: Travel Plan, Homework Scheduling, Flower Bed Beauty, and Simple Hash Table Restoration
This article presents four algorithmic interview problems covering travel scheduling with priority constraints, optimal homework task ordering, maximizing distinct garden beauty scores after a single flip operation, and reconstructing insertion sequences for a linear‑probing hash table, each with detailed analysis, solution ideas, and reference Python code.