@gonoise I had ordered the noise Air Max 4 using the unidays affiliate link and had done the payment. Now if I login I can't see the order Id in my account page.
If you need I can give you my transaction receipt. As I also haven't recieved any confirmation email.
Day 17 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Anagram Check — a classic string problem that’s all about frequency counting and efficient comparisons. Clean and satisfying to solve! #GFG#Day17#DSA#gfg160#geekstreak2025
Day 16 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Add Binary Strings — a fun exercise in simulating binary addition without using built-in functions. Loved working through the carry operations manually! #GFG#Day16#DSA#gfg160#geekstreak2025
Day 15 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Implement ATOI — converting a string to an integer without using built-in functions. It really made me focus on edge cases and careful parsing! #GFG#Day15#DSA#gfg160#geekstreak2025
Day 14 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Second Largest Element — a simple yet essential problem that reinforces the importance of careful comparisons. Building strong basics every day! #GFG#Day14#DSA#gfg160#geekstreak2025
Day 13 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Smallest Positive Missing Number — a great challenge that combined array manipulation with careful indexing. Each day is sharpening my skills a little more! #GFG#Day13#DSA#gfg160#geekstreak2025
Day 12 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Maximum Circular Subarray Sum — an interesting twist on Kadane’s Algorithm that made me think about both normal and circular cases. Really enjoyed this one! #GFG#Day12#DSA#gfg160#geekstreak2025
Day 11 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Maximum Product Subarray — a tricky one that taught me how handling negative numbers carefully can flip the entire result. Loved solving it! #GFG#Day11#DSA#gfg160#geekstreak2025
Day 10 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was based on the famous Kadane’s Algorithm — a powerful technique to find the maximum subarray sum in linear time. A must-know for every coder! #GFG#Day10#DSA#gfg160#geekstreak2025
Day 9 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was about Minimizing the Maximum Difference after modifying array elements — a great mix of sorting and greedy logic. Learned how a simple tweak #GFG#Day9#DSA#gfg160#geekstreak2025
Day 9 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was about Minimizing the Maximum Difference after modifying array elements — a great mix of sorting and greedy logic. Learned how a simple tweak #GFG#Day9#DSA#gfg160#geekstreak2025
Day 8 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Stock Buy and Sell – Max One Transaction Allowed. It was about finding the best time to buy and sell for maximum profit — simple in concept, but tricky in execution! #GFG#Day8#DSA#gfg160#geekstreak2025
Day 7 of my 160-day DSA journey with GeeksforGeeks 🚀. Today’s problem was Stock Buy and Sell — a classic that dives into maximizing profit with optimal buying and selling days. Loving how each day brings a new concept to explore! #GFG#Day7#DSA#gfg160#geekstreak2025