Aditya Sinha

I fix bugs I didn’t create and create bugs I can’t fix.

LinkedIn:

[Aditya Sinha @ADITYASINH20105]

@abd_mukadam Fake

[Aditya Sinha @ADITYASINH20105]

🚀 Day 98 Of #100DaysOfCode

✅ Problem: 3375:

🔹 Approach: If any number is less than k, return -1 (invalid as we can't increase it).

Create a set of unique numbers greater than k.
Each unique number requires one operation to bring down to k.

#letsconnect

[Aditya Sinha @ADITYASINH20105]

@kirat_tw https://t.co/c7kx8hW7Xj
@kirat_tw

[Aditya Sinha @ADITYASINH20105]

🔥 Day 97 Of #100DaysOfCode

✅ Problem: Largest Divisible Subset
🔹 Approach:
Sort the array for easier divisibility checking

DP + Backtracking to build the longest chain
Track previous index to reconstruct the path

#Leetcode #DynamicProgramming #letsconnect

[Aditya Sinha @ADITYASINH20105]

🚀 Day 96 of #100DaysOfCode | LeetCode POTD

✅ Solved: Subarrays with K Different Integers

🔹 Approach: Sliding Window + HashMap (O(N))
🔹 Key Idea: Count subarrays with at most K distinct elements, then subtract subarrays with at most K-1

#letsconnect

[Aditya Sinha @ADITYASINH20105]

🚀 Day 95 | LeetCode POTD #100DaysOfCode
✅ Solved: Maximum Value of an Ordered Triplet II
🔹 Approach: Iterative Greedy (O(N))
🔹 Key Idea: Track maxi and diff to compute optimal triplet dynamically

🔥 Optimized & Concise Solution!
#letsconnect

[Aditya Sinha @ADITYASINH20105]

@KunikaKishore interested

[Aditya Sinha @ADITYASINH20105]

@JobFound5 Interested

[Aditya Sinha @ADITYASINH20105]

@owensingh_ Great to know that you liked my approach.

[Aditya Sinha @ADITYASINH20105]

🚀 Day 94 Of #100DaysOfCode

LeetCode POTD
✅ Solved: Maximum Value of an Ordered Triplet I
🔹 Approach: One-pass traversal (O(N))
🔹 Key Idea: Maintain maxElement and maxDiff to track optimal triplet

🔥 Efficient & Clean Solution!

#letsconnect

[Aditya Sinha @ADITYASINH20105]

@ishubhamkp Thanks bro

[Aditya Sinha @ADITYASINH20105]

🚀 Day 93 of #100DaysOfCode | LeetCode POTD

✅ Solved: Solving Questions With Brainpower (DP)
🔹 Approach: Bottom-up DP (O(N))
🔹 Key Idea: Either solve the question (skip next few) or skip it

🔥 96.96% faster!
#Leetcode

[Aditya Sinha @ADITYASINH20105]

Day 92 of #100DaysOfCode

✅ Solved "Check if Grid can be Cut into Sections"
🔹 Likely involved graph traversal (DFS/BFS) to check connectivity
🔹 Possibly required finding disconnected components
🔹 Edge cases around single-component grids and corner removals
#letsconnect

[Aditya Sinha @ADITYASINH20105]

@kamilwojtalak I mean on DM

[Aditya Sinha @ADITYASINH20105]

🚀 Day 91 of #100DaysOfCode

✅ Solved Leetcode 2503: Maximum Number of Points From Grid Queries (Hard)
🔹Used Priority Queue (Min-Heap) for efficient traversal
🔹Implemented BFS-like approach to explore adjacent cells
🔹Optimized query processing by sorting queries

#letsconnect

[Aditya Sinha @ADITYASINH20105]

@kamilwojtalak can we connect personally?

[Aditya Sinha @ADITYASINH20105]

@kamilwojtalak Hii Kamil

[Aditya Sinha @ADITYASINH20105]

@ishubhamkp Sure

[Aditya Sinha @ADITYASINH20105]

🚀 Day 90 of #100DaysOfCode:

✅ Solved: Minimum Index of a Valid Split
🔹 Used HashMap to track frequency of elements
🔹 Identified the dominant element efficiently
🔹 Iterated to find the minimum valid split index

A bit late, but consistency is key! 🔥💪

#letsconnect

[Aditya Sinha @ADITYASINH20105]

🚀 Day 89 of #100DaysOfCode

✅ Solved Leetcode 38: Count and Say

🔹 Used Run-Length Encoding (RLE) to generate sequences
🔹 Iteratively built the count-and-say sequence up to n
🔹 Optimized with StringBuilder for efficient string manipulation💡

#letsconnect