Algorithms and Data Structures 2024/2025 (L.EIC011) - DCC/FCUP & DEI/FEUP

Problems available on Mooshak

Access to Mooshak | Help

Class #02 - Complexity and Asymptotic Analysis

[AED000] This is not a problem! (main exercises)
[AED001] Prime Numbers (main exercises)
[AED002] Sequence Game (main exercises)
[AED003] Saving Pipefish (extra exercises)
[AED004] Number Spiral (challenge exercises)

Class #03 - Sequential Search, Binary Search and Variants

[AED005] Number Searching (main exercises)
[AED006] Lower Bound (main exercises)
[AED007] Interval Count (main exercises)
[AED008] Backpacking Trip (main exercises)
[AED009] Closest Sums (extra exercises)
[AED010] Word Game (extra exercises)
[AED011] Cool Numbers (challenge exercises)

Class #04 - Sorting

[AED012] Game Tournament (main exercises)
[AED013] Counting the Bits (main exercises)
[AED014] Computer Lab (main exercises)
[AED015] Anagrams (main exercises)
[AED016] Football Table (extra exercises)
[AED017] Chocolate Boxes (extra exercises)
[AED018] Ferris Wheel (extra exercises)
[AED019] Counting Inversions (challenge exercises)

Class #05 - Linked Lists

[AED020] Returning an element on a given position (main exercises)
[AED021] Counting elements (main exercises)
[AED022] Removing an element on a given position (main exercises)
[AED023] Inserting an element on a given position (main exercises)
[AED024] Duplicating elements (extra exercises)
[AED025] Removing all occurrences of an element (extra exercises)

Class #06 - Lists, Stacks and Queues

[AED026] Eeny, meeny, miny, moe (main exercises)
[AED027] Perfect Weddings (main exercises)
[AED028] Round-Robin (main exercises)
[AED029] Convex Hull (extra exercises)
[AED030] Supermarket (extra exercises)
[AED031] Golden Permits (challenge exercises)

Class #07 - Binary Trees

[AED032] Counting Leafs (main exercises)
[AED033] Strictly Binary Trees (main exercises)
[AED034] Tree Paths (main exercises)
[AED035] Deep nodes (main exercises)
[AED036] Even Nodes (extra exercises)
[AED037] Sum of All Levels (extra exercises)
[AED038] Maximum Sum Path (extra exercises)
[AED039] Recovering Lost Trees (challenge exercises)

Class #08 - Balanced Binary Trees

[AED040] Sticker Collection (main exercises)
[AED041] Pokemon Battle (main exercises)
[AED042] Life Moments (main exercises)
[AED043] Movie Reviews (main exercises)
[AED044] Cool Sequences (extra exercises)
[AED045] Node Balance (extra exercises)
[AED046] Is this an AVL Tree? (extra exercises)
[AED047] Rotating a Tree (extra exercises)
[AED048] Traffic Lights (challenge exercises)

Class #09 - Introduction to Graphs + DFS

[AED049] Node Degree (main exercises)
[AED050] Node Weighted Degree (main exercises)
[AED051] Number of Connected Components (main exercises)
[AED052] Largest Component (main exercises)
[AED053] Topological Sorting (main exercises)
[AED054] Cycle Detection (main exercises)
[AED055] Bipartite Graphs (extra exercises)
[AED056] Counting Cells (extra exercises)
[AED057] Slash Maze (challenge exercises)

Class #10 - Graphs: BFS + Advanced DFS

[AED058] Node Distance (main exercises)
[AED059] Graph Diameter (main exercises)
[AED060] 2D Maze (main exercises)
[AED061] Counting Strongly Connected Components (main exercises)
[AED062] Shortest Path (extra exercises)
[AED063] Ash Cloud (extra exercises)
[AED064] Listing Strongly Connected Components (extra exercises)
[AED065] Articulation Points (extra exercises)
[AED066] Magic Squares (challenge exercises)

Class #11 - Hash Tables

[AED067] Hash Tables with Separate Chaining (main exercises)
[AED068] DNA Motifs (main exercises)
[AED069] Hash Tables with Open Addressing (extra exercises)
[AED070] Tower of Babel (extra exercises)
[AED071] Alien Words (challenge exercises)

Class #12 - Priority Queues and Heaps

[AED072] Is this a Heap? (main exercises)
[AED073] Rope Connections (main exercises)
[AED074] Highest Bidder (main exercises)
[AED075] Space Tourism (extra exercises)
[AED076] (More) Alien Words (challenge exercises)