kartikcode's

👨‍💻 Engineering | Java , Js 💥
💻 Problem Solver
✨ Learning. Building. Breaking. Rebuilding.

[kartikcode's @Kartscode]

✨💪🏻

[kartikcode's @Kartscode]

⏱️ Complexity
⌚ T.C: O(n log n) (sorting) + O(n) window scan
🫙 S.C: O(1) (no extra space)

[kartikcode's @Kartscode]

🇮🇳🔹 LeetCode Daily Challenge
📘 LC No.: 3634
💡 Approach: Sort & Slide
(Sliding Window + Two Pointers)
🔥 Day 788 Streak 💪
❤️ Like | 🔍 Follow @Kartscode
#LeetCode #ProblemSolving #BuildInPublic #DSA #Java #CodingJourney #LeetCodeDaily

[kartikcode's @Kartscode]

⏱️ Time & Space Complexity
⏱️ T.C : O(n log n)
→ Sliding window + TreeSet insert/remove & rebalancing
🫙 S.C : O(n)
→ Two TreeSets to manage window elements

[kartikcode's @Kartscode]

🇮🇳🔹 LeetCode Daily Challenge
📘 LC No.: 3013
💡 Approach: Dual Set Sliding Window
🔥 Day 784 Streak 💪
❤️ Like | 🔍 Follow @Kartscode
#LeetCode #ProblemSolving #BuildInPublic #DSA #Java #CodingJourney #LeetCodeDaily

[kartikcode's @Kartscode]

⏱️ Time & Space Complexity

⌚T.C : O(26³ + n) → effectively O(n) (since 26 is constant)
🫙S.C : O(26²) → constant space

[kartikcode's @Kartscode]

🇮🇳🔹 LeetCode Daily Challenge
📘 LC No.: 2976
💡 Approach: Floyd–Warshall on Characters (All-Pairs Shortest Path)
🔥 Day 780 Streak 💪
❤️ Like | 🔍 Follow @Kartscode
#LeetCode #ProblemSolving #BuildInPublic #DSA #Java #CodingJourney #LeetCodeDaily

[kartikcode's @Kartscode]

⏱️ Time & Space Complexity
⌚ T.C: O(n log n)
-> sorting dominates
🫙 S.C: O(1)
-> extra space (excluding output list)

[kartikcode's @Kartscode]

🇮🇳🔹 LeetCode Daily Challenge
📘 LC NO.: 1200
💡 Approach: Sort & Scan
🔥 Day 777 Streak 💪
❤️ Like | 🔍 Follow @Kartscode
#LeetCode #ProblemSolving #BuildInPublic #DSA #Java #CodingJourney #LeetCodeDaily

[kartikcode's @Kartscode]

⏱️ Time & Space Complexity
⌚ T.C : O(n log n)
-> Sorting dominates the runtime
🫙 S.C: O(1)
-> No extra space (in-place sorting)

[kartikcode's @Kartscode]

🇮🇳🔹LeetCode Daily Challenge
📘 LC NO.: 1984
💡 Approach: Sort & Shrink Window
🔥 Day 776 Streak 💪
❤️ Like | 🔍 Follow @Kartscode
#LeetCode #ProblemSolving #BuildInPublic #DSA #Java #CodingJourney #LeetCodeDaily

[kartikcode's @Kartscode]

⏱️ Time & Space Complexity
✅ T.C : O(n) Each number is processed in constant time (bit shifts are bounded by 32 bits).
✅ S.C : O(1) (excluding output array)

[kartikcode's @Kartscode]

🇮🇳🔹 LeetCode Daily Challenge
📘 LC: 3314 – Construct the Minimum Bitwise Array I
💡 Approach: Trailing-Ones Trick 🧠
🔥 Day 771 Streak 💪
❤️ Like | 🔍 Follow @Kartscode
#LeetCode #ProblemSolving #BuildInPublic #DSA #Java #CodingJourney #LeetCodeDaily

[kartikcode's @Kartscode]

⏱️ Time & Space Complexity
⌚ Time Complexity: O(m × n × min(m, n))
🫙 Space Complexity: O(1) (in-place prefix sum)

[kartikcode's @Kartscode]

🇮🇳🔹 LeetCode Daily Challenge
📘 LC: 1292 – Maximum Side Length of a Square with Sum ≤ Threshold
💡 Approach: Prefix Sum Square Growth
🔥 Day 770 Streak 💪
❤️ Like | 🔍 Follow @Kartscode
#LeetCode #ProblemSolving #BuildInPublic #DSA #Java #CodingJourney #LeetCodeDaily

[kartikcode's @Kartscode]

@achieve71246717 Nicely done 👌
Classic recursion + backtracking pattern explained well.
Pick → Recurse → Backtrack is the real DSA mindset 🔥

[kartikcode's @Kartscode]

⏱️ Time & Space Complexity
⌚ T.C: O(n²) —> checking all rectangle pairs
🫙 S.C: O(1) — > no extra data structures

[kartikcode's @Kartscode]

🇮🇳🔹 LeetCode Daily Challenge
📘 LC.: 3047
💡 Approach: Brute-Force Rectangle Intersection
🔥 Day 768 Streak 💪
❤️ Like | 🔍 Follow @Kartscode
#LeetCode #ProblemSolving #BuildInPublic #DSA #Java #CodingJourney #LeetCodeDaily

[kartikcode's @Kartscode]

⏱️Time & Space Complexity
⌚T.C : O(H² + V²)
H = number of horizontal fences
V = number of vertical fences
We check all pairwise distances

🫙S.C : O(H²)
For storing all horizontal distances in a HashSet

[kartikcode's @Kartscode]

🇮🇳🔹 LeetCode Daily Challenge
📘 LC.: 2975 – Maximum Square Area by Removing Fences
💡 Approach: Common Distance Matching
🔥 Day 767 Streak 💪
❤️ Like | 🔍 Follow @Kartscode

#LeetCode #ProblemSolving #BuildInPublic #DSA