PromptWars – Build with AI
Built Perspectra — “A Wider View of Every Decision” in 3 hours, from build to deployment.
🏆Top 50 | 90.28/100
400+ registrations • 200 shortlisted
Thanks to Engineering India, Hack2Skill, GDG Nagpur!
https://t.co/7U8y9Uyp6O
#PromptWars#BuildWithAI
Attended AWS Community Day Nagpur 2026 at Persistent Systems—an inspiring day of learning, networking, and insights from industry experts. Grateful to the AWS User Group Nagpur team, speakers, volunteers, and sponsors! #AWSCommunityDay#ACDNGP26
“So what exactly was the selection criteria?” 🤔
@geeksforgeeks
Completed the #GeekStreak60 challenge consistently and still received a generic “not selected” email.
At least participants deserve to know the actual reason for rejection
REPOST
#GeekStreak60#GeeksforGeeks#NPCI
#100DaysOfCode 🚀
Solved today’s GFG POTD — Make the array beautiful
Used a stack-based approach to remove adjacent elements with opposite signs and build the final beautiful array efficiently.
#GFGPOTD#GeeksforGeeks#DSA#CPP
#100DaysOfCode 🚀
Solved today’s GFG POTD — Not a subset sum
Used sorting + greedy approach
Missed my POTD and broke a few streaks because of end sem exams and exhaustion, but getting back on track
#GFGPOTD#GeeksforGeeks#DSA#CPP
Day 85 of #100DaysOfCode 🚀
Solved today’s GFG POTD — Search for Subarray 🔍
Used a simple sliding comparison approach to find all starting indices where array b appears inside array a ✅
#GFGPOTD#GeeksforGeeks#DSA#CPP
Day 84 of #100DaysOfCode 🚀
Solved today’s GFG POTD — Mother Vertex 🌐
Used DFS to find a potential mother vertex and then verified whether it can reach every node in the graph ✅
#GFGPOTD#GeeksforGeeks#DSA#CPP
Day 83 of #100DaysOfCode 🚀
Solved today’s GFG POTD — Range LCM Queries
Initial brute-force solution failed on the last test case due to TLE
Optimized it using a Segment Tree for efficient range LCM queries and updates
#GFGPOTD#GeeksforGeeks#DSA#CPP
Day 82 of #100DaysOfCode 🚀
Finally optimized today’s GFG POTD — Palindrome Pairs
Brute force passed most test cases but gave TLE at the end
Used hashing + palindrome splitting approach to reduce complexity and get AC
#GFGPOTD#GeeksforGeeks#DSA#CPP
Day 81 of #100DaysOfCode 🚀
Solved today’s GFG POTD — Max Profit from Two Machines ⚙️
Used greedy sorting based on profit difference to maximize total profit efficiently.
#GFGPOTD#GeeksforGeeks#DSA#CPP
Day 80 of #100DaysOfCode 🚀
Solved today’s GFG POTD — Count Spanning Trees in a Graph
Learned about spanning trees and used Cayley’s Theorem for complete graphs.
#GFGPOTD#GeeksforGeeks#DSA#CPP
Day 79 of #100DaysOfCode 🚀
Solved today’s GFG POTD — Remove Invalid Parentheses
Used BFS + validity checking to generate all valid strings with minimum removals.
#GFGPOTD#GeeksforGeeks#DSA#CPP
Day 78 of #100DaysOfCode 🚀
Solved today’s GFG POTD — Check if Subtree
Used recursion to compare trees and check whether one binary tree exists as a subtree inside another.
#GFGPOTD#GeeksforGeeks#DSA#Consistency