Bouncy Flouncy Trouncy Pouncy - codepath/compsci_guides GitHub Wiki

TIP102 Unit 1 Session 1 Advanced (Click for link to problem statements)

TIP102 Unit 1 Session 2 Standard (Click for link to problem statements)

Problem Highlights

  • 💡 Difficulty: Easy
  • Time to complete: 5 mins
  • 🛠️ Topics: Lists, Iteration, Conditionals

U-nderstand

Understand what the interviewer is asking for by using test cases and questions about the problem.

  • Q: What is the input to the function?

    • A: The input is a list of strings operations where each string is either "bouncy", "flouncy", "trouncy", or "pouncy".
  • Q: What is the expected output of the function?

    • A: The function should return the final value of the variable tigger after performing all the operations.
  • Q: What are the initial conditions or constraints?

    • A: Initially, the value of tigger is 1. The list operations can contain any number of strings, including none.
  • Q: How should operations be interpreted?

    • A: "bouncy" and "flouncy" increment the value of tigger by 1, while "trouncy" and "pouncy" decrement the value of tigger by 1.
  • Q: What if the list is empty?

    • A: If the list is empty, the value of tigger remains 1.
  • The function final_value_after_operations() should take a list of strings operations and return the final value of the variable tigger after performing all the operations. The initial value of tigger is 1.

HAPPY CASE
Input: operations = ["trouncy", "flouncy", "flouncy"]
Expected Output: 2
Explanation: The operations are performed as follows:
Initially, tigger = 1.
trouncy: tigger is decremented by 1, tigger = 0.
flouncy: tigger is incremented by 1, tigger = 1.
flouncy: tigger is incremented by 1, tigger = 2.

Input: operations = ["bouncy", "bouncy", "flouncy"]
Expected Output: 4
Explanation: The operations are performed as follows:
Initially, tigger = 1.
bouncy: tigger is incremented by 1, tigger = 2.
bouncy: tigger is incremented by 1, tigger = 3.
flouncy: tigger is incremented by 1, tigger = 4.

EDGE CASE
Input: operations = ["trouncy"]
Expected Output: 0
Explanation: The only operation decrements tigger to 0.

P-lan

Plan the solution with appropriate visualizations and pseudocode.

General Idea: Initialize tigger to 1, then iterate through the list of operations to modify tigger based on the operation type.

1. Define the function `final_value_after_operations(operations)`.
2. Initialize the variable `tigger` to 1.
3. Iterate through the list of `operations`.
4. For each operation:
   - If it is "bouncy" or "flouncy", increment `tigger` by 1.
   - If it is "trouncy" or "pouncy", decrement `tigger` by 1.
5. Return the final value of `tigger`.

⚠️ Common Mistakes

  • Forgetting to account for all operation types.
  • Not initializing tigger correctly.

I-mplement

Implement the code to solve the algorithm.

def final_value_after_operations(operations):
    # Initialize tigger to 1
    tigger = 1
    
    # Iterate through the list of operations
    for operation in operations:
        if operation == "bouncy" or operation == "flouncy":
            tigger += 1
        elif operation == "trouncy" or operation == "pouncy":
            tigger -= 1
    
    # Return the final value of tigger
    return tigger