Aaj ka Code

🚀 DSA, GFG POTD & coding interview prep with intuition-first explanations. Learn to think, optimize & solve problems. Code se zyada, Soch Samjho! 💻

[Aaj ka Code @AajKaCode]

🔥 GFG POTD: Count Pairs Violating BST Property

My approach:
🌳 Inorder Traversal
⚡ Merge Sort + Inversion Counting
⏱️ O(n log n) time

💻 https://t.co/DfJzOtu7GW

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔥 GFG POTD: Palindrome with Replacement

Replace '?' to form a palindrome while minimizing adjacent ASCII differences.

🧠 Two Pointers + Greedy
⏱️ O(n)

💻 https://t.co/VQl7u8RN1P

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔥 GFG POTD: Minimum Sum Subarray

Kadane's Algorithm, but for the minimum!

🧠 Track the minimum subarray ending at each index
⏱️ O(n) time | O(1) space

💻 https://t.co/Oqnklonf82

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔥 GFG POTD: Largest with Same Parity Adjacent Swaps

The key observation: elements of different parity cannot swap!
✅ Group by parity
✅ Sort each group in descending order
⏱️ O(n log n)

Link: https://t.co/Ne1NvVZtW1

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔥 GFG POTD: Count Indices That Escape Array

Can you identify which indices eventually escape and which get trapped in cycles?

🧠 DFS + Cycle Detection
⏱️ O(n) time | O(n) space

💻 https://t.co/wwNlEIPRbk

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔥 GFG POTD: Convert One String to Another with Constraints

A moves left. B moves right. Neither can cross.

🧠 Two Pointers
⏱️ O(m+n) time
💻 C++

🎥 Watch: https://t.co/3iYp6GUuCp

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔎 GFG POTD: Successful Binary Searches Irrespective of Pivot

The trick? Prefix Max + Suffix Min.

✅ Identify elements guaranteed to be found
⏱️ O(n) time
💻 C++

🎥 Watch: https://t.co/IjmBbJ5I3R

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔥 GFG POTD: Maximum Without 3 Consecutive Set Bits

Can you maximize n without allowing 111 in binary?

Example: 7 → 111 → 110 → 6

🧠 Greedy + Bit Manipulation
⏱️ O(log n)

🎥 Watch: https://t.co/8M63Kwm7fy

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔤 GFG POTD: Roll Characters of String

Multiple prefix updates? Don't update every character for every operation!

✅ Difference Array + Prefix Sum
⏱️ O(n + m)
💻 C++ | Company: Airtel

🎥 Watch: https://t.co/JbAqjokd3Z

Code se zyada, Soch Samjho.
#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

GFG POTD: Minimum Squares with Full Cuts

A simple Greedy Approach to minimize the number of squares.

⏱️ O(log(min(n, m)))
💻 C++
Company Tag: Amazon

🔗 Watch the full video: https://t.co/9Jg5bdtT7o

Code se zyada, Soch Samjho.

#DSA #GFGPOTD #100DaysOfCode

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Minimum Operations to Reach N

The trick is to think backward! 🧠

Even → Divide by 2
Odd → Subtract 1
Example: 8 → 4 → 2 → 1 → 0

⏱️ O(log N) | O(1) space

🎥 https://t.co/gvXf21I2dn

#GFGPOTD #DSA #Cpp

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Maximum Frequency with K Increments

Sort the array → maintain a sliding window → make every element equal to arr[r].

🧠 Cost = target × window_size − window_sum

🎥 https://t.co/aFqIzxLJlB

Code se zyada, Soch Samjho. ❤️

#GFGPOTD #DSA #Cpp #SlidingWindow

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Max Path Sum Between Two Leaves

Classic Tree DP 🧠
For every node:
🍃 Return → best root-to-leaf path
🔥 Update → left + root + right
⏱️ O(N)
💾 O(H)

🎥 https://t.co/k19mUiMtJV

Code se zyada, Soch Samjho. ❤️

#GFGPOTD #DSA #Cpp #BinaryTree

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Longest Increasing Path in Matrix

🧠 DP + Memoization
↔️ 4-direction movement
📈 Strictly increasing values
⏱️ O(N × M)
Each cell stores the longest increasing path starting from it.

🎥 https://t.co/gRZDR5f0X8

Code se zyada, Soch Samjho. ❤️
#GFGPOTD #DSA #Cpp #DP

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Your Social Network

Each user points to a smaller-numbered user, so we can simply follow the friend links until reaching User 1.

🧠 Simple traversal

💻 C++

⏱️ O(N²)

🎥 https://t.co/hmTGzYWOyc

Code se zyada, Soch Samjho. ❤️

#GFGPOTD #DSA #Cpp

[Aaj ka Code @AajKaCode]

🔥 LIVE — LeetCode Weekly Contest 522 Q4 Upsolve

Breaking down Q4 step by step:

🧠 Observation
💡 Approach
💻 C++
⏱️ Complexity

🎥 https://t.co/JOolJyBPdO

Code se zyada, Soch Samjho. ❤️

#LeetCode #DSA #Cpp

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Coils in Matrix

Form two coils from a 4n × 4n matrix starting from opposite corners.

➡️ Opposite spiral directions
➡️ Matrix traversal
➡️ Careful boundary handling

🎥 https://t.co/OpYNgPTNhF

Code se zyada, Soch Samjho. ❤️

#GFGPOTD #DSA #Matrix #Cpp

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Lexicographically Smallest Rotation

How do you find the smallest rotation of a string in O(N)?

👉 Booth's Algorithm
👉 Compare two candidate rotations
👉 O(N) time

🎥 https://t.co/UR4rVlcszk

Code se zyada, Soch Samjho. ❤️

#DSA #Strings #GFGPOTD #Cpp

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Minimum Time to Finish Project

Kahn’s Algorithm + Topological Sort → minimum project time.

⏱️ O(N + M)

🎥 https://t.co/Go50NWYomi

Code se zyada, Soch Samjho. ❤️
#GFGPOTD #DSA #TopologicalSort #Cpp

[Aaj ka Code @AajKaCode]

🔥 GFG POTD — Ways to Reach Origin

Only 2 moves:
⬅️ Left
⬇️ Down

At every point:
ways(x,y) = ways(x-1,y) + ways(x,y-1)

Solved using DP + Memoization 🧠

⏱️ O(X × Y)
💾 O(X × Y)

🎥 Full Video: https://t.co/TSw17qCvcH

Code se zyada, Soch Samjho. ❤️

#DSA #DP #GFGPOTD #Cpp