Skip to content

Refactor inventory code to find smallest and biggest parts - #149

Open
harshmendhe-arch wants to merge 1 commit into
codedex-io:mainfrom
harshmendhe-arch:patch-4
Open

harshmendhe-arch wants to merge 1 commit into
codedex-io:mainfrom
harshmendhe-arch:patch-4

Conversation

@harshmendhe-arch

Copy link
Copy Markdown

No description provided.

Copilot AI lite review requested due to automatic review settings September 20, 2026 14:34

Copilot AI left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Copilot review overview

🟢 Approval recommended

Only minor style and header consistency nits remain.

Review effort: Lite
Findings: 1 Low severity

Open (1)
What changed in this PR

Refactors the inventory exercise to calculate and print the smallest and largest LEGO parts.

Changes:

  • Stores min(lego_parts) in smallest.
  • Stores max(lego_parts) in biggest.
  • Prints both results.
File Description
5-lists/​24_inventory.py Refactors minimum and maximum inventory calculations into named variables.

💡 Add a code-review agent skill or configure MCP servers for context-aware, tailored reviews. Learn more in the docs.

Comment thread 5-lists/24_inventory.py
# Write code below 💖

lego_parts = [8980, 7323, 5343, 82700, 92232, 1203, 7319, 8903, 2328, 1279, 679, 589]
smallest =min(lego_parts)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants