Day 5
🗓 Daily Challenge #1
🧩 Build Array from Permutation
Given an array nums, build a new array ans where ans[i] = nums[nums[i]] for every index i.
Can you solve it without extra space? (Hint: Think modulo!)

🔗 Problem Link:
📌 Difficulty: Easy
🏷 Tags: #Array #InPlace

💡 Let’s see your optimized solutions!
👉 Drop your approach in the comments!

📊 Problem Breakdown #2
🔄 Matrix Rotation Check
Given two n x n matrices, determine if one can be obtained by rotating the other 90°, 180°, or 270°.
How would you efficiently check all possible rotations?

🔗 Problem Link:
📌 Difficulty: Medium
🏷 Tags: #Matrix #Transpose

🤔 Think about transpose + reverse vs. brute force. Which is better?
👉 Share your code snippets!

🚀 Advanced Problem Alert!
🔢 Tuple with Same Product
Find the number of tuples (a, b, c, d) such that a*b = c*d where all elements are distinct.
Can you avoid an O(n⁴) solution? (Hint: Hash maps are your friend!)

🔗 Problem Link:
📌 Difficulty: Medium
🏷 Tags: #HashTable #Combinatorics

💥 Challenge: Optimize for large arrays!
👉 Post your best time complexity in the comments!