Raj

20 | Engineer

[Raj @TechVigilante33]

Sailing into Pirates of the Coral-bean ☠️⚓

Excited to explore how Coral lets AI agents query APIs, databases & files as SQL.

@WeMakeDevs
@WithCoral_com

#AI #opensource #hackathon

[Raj @TechVigilante33]

@WeMakeDevs donee

[Raj @TechVigilante33]

@jasneet2003 invite

[Raj @TechVigilante33]

@BTZOglobal MI 💙
The Raipur pitch can get some really good for batting after the powerplay, and with MI’s batting depth, I feel they’ll outscore RCB tomorrow

[Raj @TechVigilante33]

Looking for active learner who are in tech 🫡

Lets connect & grow together ‼️

#connect #tech

[Raj @TechVigilante33]

@BrewedByKetaki @NPCI_NPCI @geeksforgeeks Yeah i continued on my remaining half streak on LinkedIn
I hope it reaches with them🤞

[Raj @TechVigilante33]

@BrewedByKetaki @NPCI_NPCI @geeksforgeeks bro where is that form can you pls dm me🙏

[Raj @TechVigilante33]

Day 22 : Minimum K Consecutive Bit Flips
@geeksforgeeks @NPCI_NPCI
Greedy approach: flip when current effective bit is 0.
Track active flips using a difference array to achieve O(n).
Time: O(n) | Space: O(n)

#geekstreak60 #GFG60 #DSA #Java

[Raj @TechVigilante33]

Day 21: Sum of Subarray Minimums

Use monotonic stacks to find previous & next smaller elements.
@geeksforgeeks @NPCI_NPCI
Each element contributes arr[i] × left × right.
Time: O(n) | Space: O(n)

#geekstreak60 #GFG60 #DSA #Java

[Raj @TechVigilante33]

Day 20: Subarrays with First Element Minimum

For each index, find the next smaller element to the right using a monotonic stack.
@geeksforgeeks @NPCI_NPCI
Valid subarrays = distance to that element.
Time: O(n) | Space: O(n)

#geekstreak60 #GFG60 #DSA #Java

[Raj @TechVigilante33]

@dheyo_ron @kingyru But bro what's the use of this like we can't withdraw it and where to spend it then?

[Raj @TechVigilante33]

Day 19 : Largest Number in One Swap

Store last index of digits (0–9)
@geeksforgeeks
For each position, tried swapping with the largest digit appearing later to maximize the number
@NPCI_NPCI
Time: O(n) | Space: O(1)

#geekstreak60 #GFG60 #DSA #Java

[Raj @TechVigilante33]

@Aakashi_123 Becoz our parents won't be able to check our books and all

[Raj @TechVigilante33]

Day 18 : Pythagorean Triplet #geekstreak60

Square all numbers and store them in a set.
For each pair (a, b), check if a² + b² exists.
Time: O(n²) | Space: O(n)
@geeksforgeeks @NPCI_NPCI
#GFG60 #DSA #Java

[Raj @TechVigilante33]

Day 17: Dice Throw #geekstreak60

Use Dynamic Programming.
Let dp[i][j] be ways to get sum j using i dice.
Transition by trying every face value 1..m
Time: O(n × x × m) | Space: O(n × x)

#GFG60 #DSA #Java #DynamicProgramming
#npcl @NPCI_NPCI

[Raj @TechVigilante33]

Day 16

[Raj @TechVigilante33]

Day 15 : Longest Substring with K Uniques #geekstreak60

Use a sliding window + frequency array.
Expand right pointer, shrink left when distinct chars > k.
Update answer when distinct == k.
Time: O(n) | Space: O(1)
#GFG60 #DSA #Java #NPCL

[Raj @TechVigilante33]

Day 14 Trapping Rain Water #geekstreak60

Water at each index depends on min(maxLeft, maxRight).
Using two pointers, track leftMax and rightMax while traversing from both ends.
Efficient solution without extra arrays.

Time: O(n) | Space: O(1)

#GFG60 #NPCL #DSA #Java

[Raj @TechVigilante33]

Day 13: Max XOR Subarray of Size K #geekstreak60

Use a sliding window of size k.
Compute XOR of the first window, then update by removing the left element and adding the next element using XOR properties.
Time: O(n) | Space: O(1)

#GFG60 #DSA @NPCI_NPCI #NPCL