SOUJITH JADI

135 posts

SOUJITH JADI

SOUJITH JADI

@SOUJITH_JADI

Katılım Temmuz 2025
51 Takip Edilen1 Takipçiler
SOUJITH JADI retweetledi
Best PropFirms
Best PropFirms@Prop_Firms·
Giveaway🥳 from Prop Firm @8Cchallenges 10 x 10k 2-step challenge accounts To enter for a chance to win 👇 1️⃣ Follow @Prop_Firms & @8Cchallenges 2️⃣ Like & Retweet this Post 3️⃣ Comment 'EIGHTCAP' 📅 Ends: 15th of January at 8am (ET) 🏆 Winners chosen at random & contacted via DM Join our Discord for more exclusive Prop Firm Giveaways 👉 discord.gg/q9WYQrtHbT #giveaway #propfirmgiveawat #eightcapchallenges #like #retweet #proptrading #propfirms #massive
Best PropFirms tweet media
English
744
697
775
39K
Pi News
Pi News@PiListingNews·
Pick any one number from 1–50 to win a $10,000 Instant Account! 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 🏆3 numbers are hidden with a special gift for you ! Winners will be DM’d within 48Hrs 👀
English
3.9K
265
1.5K
336.7K
FundedX
FundedX@fundedxofficial·
Pick any one number from 1–50 to win a $100,000 Instant Account! 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 🏆3 numbers are hidden with a special gift for you ! Winners will be DM’d within 48Hrs 👀
English
26.4K
664
5K
2.3M
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
FundingPips@fundingpips

🎁 Built to help our community scale, just like the last giveaway. Simple entry through FundingPips Dashboard. Log in, follow the steps, and enter before the New Year. To enter our giveaway, complete all the steps below on our official giveaway post: 1️⃣ Follow @fundingpips 2️⃣ Follow @khldfx 3️⃣ Comment your favorite feature about FundingPips and tag 3 friends in the same comment 4️⃣ Share this post to your Story and tag @fundingpips ✅ All steps must be completed to qualify

QAM
0
0
0
0
FundingPips
FundingPips@fundingpips·
🎁 Built to help our community scale, just like the last giveaway. Simple entry through FundingPips Dashboard. Log in, follow the steps, and enter before the New Year. To enter our giveaway, complete all the steps below on our official giveaway post: 1️⃣ Follow @fundingpips 2️⃣ Follow @khldfx 3️⃣ Comment your favorite feature about FundingPips and tag 3 friends in the same comment 4️⃣ Share this post to your Story and tag @fundingpips ✅ All steps must be completed to qualify
FundingPips tweet media
English
2.2K
1.7K
2K
64.6K
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
@larkfunding Answer is C . Hoping account is mine for new year. I am ready !!
English
0
0
1
5
larkfunding
larkfunding@larkfunding·
Lark Funding Advent Calendar: Day 5 🎁 Win a $10K account 🤑 Answer in the comments: How long has Lark Funding been in business? A) 6 months (LOL) B) 1 year C) 3+ years D) Long enough to have seen your favorite "discount firm" disappear twice Tomorrow we announce the winner!
English
258
63
170
6.7K
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
✅ Day 63: Problem: Make Array Elements Unique Approach: First sort the array. Then for each element, if it’s not greater than the previous one, increment it until it becomes prev + 1. Keep track of all increments as the answer. Greedy ensures minimum operations in O(n log n). 🔥
SOUJITH JADI tweet media
English
1
0
0
11
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
Day 62: Problem: Meeting Rooms Approach: First sort the meetings by their start time. Then check each consecutive pair to see if the current meeting starts before the previous one ends. If yes, return false; otherwise, true. Ensures no overlap in O(n log n). 💡 @geeksforgeeks 💪
SOUJITH JADI tweet media
English
1
0
0
9
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
Day 61 with gfg: Problem:Merge Two Sorted Linked Lists Approach: Used recursion to compare nodes of both lists. At each step, attach the smaller node to the result and move forward in that list. Base case handles when one list becomes empty. Simple yet elegant recursive solution
SOUJITH JADI tweet media
English
1
0
0
7
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
Day 60: Problem: Rotate a Linked List Approach: First find the length of the list and adjust k using modulo (k % length). Then locate the new head by traversing k nodes, break the link, and connect the old tail to the old head. Handles large k values efficiently. @geeksforgeeks💪
SOUJITH JADI tweet media
English
1
0
0
5
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
Day 59: Problem: Add Number Linked Lists Approach: First reverse both lists to process from least significant digit. Traverse both while adding digits + carry, create nodes for sum%10, move carry forward. Finally, reverse result to get the correct order.
SOUJITH JADI tweet media
English
1
0
0
3
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
✅ Day 58: Problem: Reverse a Linked List Approach: Used iterative method with three pointers (prev, current, next). At each step, reverse the pointer direction, move ahead, and finally return the new head (prev). Efficient O(n) time and O(1) space. 🔥 @geeksforgeeks 💪
SOUJITH JADI tweet media
English
1
0
0
2
SOUJITH JADI
SOUJITH JADI@SOUJITH_JADI·
✅ Day 57: Problem: Longest Subarray with Sum K Approach: Used prefix sum + HashMap to store earliest indices. For each element, check if (sum - k) exists. If yes, update max length. Handles both positive & negative numbers efficiently in O(n). 🔥 @geeksforgeeks 💪
SOUJITH JADI tweet media
English
1
0
0
2