:-)

Professional Procrastinator

[:-) @MadhurBoard]

I always figure it out on my own, I just have to panic first.

#100DaysOfCode
#100daysofcodechallenge #javascript #webdevelopment #Frontend
#developer #selftaughtprogrammer
#programming #VWordPress

[:-) @MadhurBoard]

@sejalbehera @striver_79 @takeUforward_ Let’s go 🎉

[:-) @MadhurBoard]

@AppleSupport I made a ₹50,000 payment via HDFC debit card on 3 Nov 2025 at Apple Store Koregaon Park, Pune, for an iPhone 17 Pro. The amount was debited but not captured by the store.
Despite multiple emails, no response yet. Please help resolve this urgently.
@Apple

[:-) @MadhurBoard]

@AppleSupport @Apple Pune Koregaon Park — On 03 Nov 2025 at ~20:53, ₹50,000 was debited from my HDFC debit card (****8554) for an iPhone 17 Pro, but the transaction wasn’t captured at the store.

The store isn’t responding to any emails and i did not even get help at the store

[:-) @MadhurBoard]

@SamsungMobile #stop

[:-) @MadhurBoard]

@robj3d3 https://t.co/wsclrwFYr2

[:-) @MadhurBoard]

🚀 Just built AlgoViz for the Lovable AI Hackathon – an interactive visualizer for algorithms powered by Google Gemini!
Visual, intuitive & fun 💡
Try it here 👉 https://t.co/OYqDplAJfg
#AI #coding #hackathon #AlgoViz

[:-) @MadhurBoard]

@forloopcodes https://t.co/Ypy6feXY6J

[:-) @MadhurBoard]

@ramxcodes https://t.co/Ypy6feXY6J

[:-) @MadhurBoard]

Coding is now about problem solving, not about syntax

[:-) @MadhurBoard]

@Strawwww_berry Madhur Patil

[:-) @MadhurBoard]

🎯 Day 64/100 of My LeetCode Challenge 🎯
🚀 Problem: Find the Number of Distinct Colors Among the Balls
Solution: Used a hash set to track unique colors in O(n) time. The answer is simply the size of the set!
A simple problem reinforcing set properties.
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Day 63/100 of My LeetCode Challenge 🎯
🚀 Problem: Tuple with Same Product
🔑 Solution: Used hash map to count product pairs. For each product with k pairs, the total valid tuples = 8 × (k choose 2).
📝 Efficient O(n²) approach!
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Day 62/100 of My LeetCode Challenge 🎯
🚀 Problem: Check if One String Swap Can Make Strings Equal
🔑 Solution: Compared characters at differing indices. If exactly two mismatches exist and swapping them equalizes both strings, return true.
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Day 61/100 of My LeetCode Challenge 🎯
🚀 Problem: Maximum Ascending Subarray Sum
🔑 Solution: Used a sliding window approach, keeping track of the sum of an ascending subarray and resetting when the order breaks.
📝 Optimized in O(n) time!
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Day 60/100 of My LeetCode Challenge 🎯
🚀 Problem: Longest Strictly Increasing or Strictly Decreasing Subarray
🔑 Solution: Used two pointers to track the longest increasing and decreasing subarrays efficiently in O(n) time.
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Day 59/100 of My LeetCode Challenge 🎯
🚀 Problem: Check if Array is Sorted and Rotated
🔑 Solution: Checked if the array can be considered sorted and rotated by counting the number of places where the array decreases.
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Day 58/100 of My LeetCode Challenge 🎯
🚀 Problem: Divide Nodes Into the Maximum Number of Groups
🔑 Solution: Used BFS and graph coloring to determine the maximum valid partitioning of nodes while maintaining adjacency constraints.
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Day 57/100 of My LeetCode Challenge 🎯
🚀 Problem: Redundant Connection
🔑 Solution: Used Union-Find (Disjoint Set) data structure to efficiently detect and remove redundant edges that form a cycle in an undirected graph.
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Day 56/100 of My LeetCode Challenge 🎯
🚀 Problem: Maximum Number of Fish in a Grid
🔑 Solution: Solved using DFS to explore connected components in the grid and calculate the total fish count.
Improved skills in grid traversal and depth-first search!
#LeetCode #100DaysOfCode

[:-) @MadhurBoard]

🎯 Tackling Course Schedule IV on LeetCode 🎯
🚀 Problem: Course Schedule IV
🔑 Key Idea: Used graph traversal with a Floyd-Warshall algorithm to compute reachability between all course pairs.
#LeetCode #Graphs #100DaysOfCode