DAY 48 Arrays and Strings: Relationships and Constraints

Hello Everyone!

On the third day of Week 10 we extended what regarding Array and String more precisely related with the calculation of relationships within arrays, Tasks of the day resembled some giant and complex systems of equations, and each action was driven by constraints responding to the problem equations.

---

How the Day Went

1. Product of Array Except Self (Medium Difficulty)

   • Task: Find the setup of an array such that each of its elements equals the product of all the other elements not including division.
   • Approach:
     • Used a two-pass strategy:
     • First pass: Calculated the prefixes of each of the elements.
     • Second pass: To accomplish this we combined these with suffix products iteratively where a single variable tracked the suffix. Skipped the division all together, which made sure that the solution in question was both, within the constrains and effective.
   • What Made It Fun: It was enlightening to observe the array transform progressively as a syntax-act of permutation and combination on the prefix and suffix products, which offered a real-time approach to completing the pieces of the solution.

2. **Increasing Triplet Subsequence/Subsequence of size three (Medium Level)*

   • Task: This problem asks you to decide whether a monotonically increasing subsequence of length 3 exists in the array.
   • Approach: Utilized first and second to reserve one variable for the smallest and the second smallest input encountered in the program. Had a check for the presence third element greater than `second’ to do with the triplet condition.
   • What Made It Fun: It became like solving a logical sequence and tracking the sequence earlier and the precise point when the condition was met.

---

Intriguing Events Today

1. Real-Time Updates:
   
   In both tasks it was needed to change a value of a variable or elements of an array while the process is going on.

2. Efficient Computation:
   
   Brute force was perfectly omitted in solutions such as Product of Array Except Self where prefix and suffix thinking made the solution very clean and efficient.

3. Observing Patterns:
   
   Increasing Triplet Subsequence also focused on the everyday search for links within the array, highlighting the ability to observe and track.

---

Key Takeaways

• Prefix and Suffix Calculations Simplify Problems:
  
  One of the nicest things in Product of Array Except Self is that the two-pass calculation is an example of layered computation.

• Dynamic Tracking Enhances Efficiency:
  
  As we go through the array as done in Increasing Triplet Subsequence, it is clear that updating variables which make the problem take linear time becomes important.

• Step-by-Step Problem-Solving Works:
  
  This makes the solution of complex problems easy and accurate since it is easy to handle smaller portions of a solution than a whole big chunk.

---

Reflections

The Product of Array Except Self was a good challenge of design whereby one gets to consider logic as well as how to optimize an algorithm. On the other hand, Increasing Triplet Subsequence came up with an exciting twist by incorporating real-time tracking aspect to the problem. Combined with one another these problems underlined much effort, which is to be given to the planning process and proper algorithms in array problem environment.

---

What’s Next?

We’ll complete Week 10 tomorrow with Arrays and Strings, Two-Pointer Problems, solving String Compression and Move Zeroes. These tasks will challenge my capacity to carry control of elements besides the ability to retain lucidity of thought while doing so.

Thanks for being part of this journey. We all should continue to learn, develop and work through efficient solutions for the tasks at hand.