RCS.101.d

Map of Contents

RCS.101.d

Advanced Stack

[RCS.101 x Miters] Advanced Stack (1)

[RCS.101 x Miters] Advanced Stack (2)

Topological Order/Sort

[RCS.101 x Miters] Topological Order/Sort

Advanced Stack (Expression Processing)

• Learning Material

  • Dijkstra’s Two-Stack Algorithm

    • H 224. Basic Calculator

  • Comp Sci in 5: Shunting Yard Algorithm

    • M 370 · Convert Expression to Reverse Polish Notation

• Practices

  • M 150. Evaluate Reverse Polish Notation

  • M 887 · Ternary Expression Parser

  • M 394. Decode String

  • M 385. Mini Parser

  • M 244 · Delete Char

  • M 834 · Remove Duplicate Letters

  • M 12 · Min Stack

  • M 40 · Implement Queue by Two Stacks

• Graduation Challenge

  • M 227. Basic Calculator II

  • M 271 · prefix notation to postfix notation

  • M 276 · another zuma

---

Topological Order/Sort

• Learning Material

  • Kahn's Algorithm

    • M 210. Course Schedule II

  • Floyd's Cycle Detection Algorithm

    • M 802. Find Eventual Safe States

• Practices

  • M 207. Course Schedule

  • M 1462. Course Schedule IV

  • M 3673 · Parallel Courses

• Graduation Challenge

  • M 605 · Sequence Reconstruction

  • M 127 · Topological Sorting