Full Stack Developer @ Prashne
Building Prashne’s AI interviewer platform end-to-end. Passionate about GenAI, scalable systems, and smart user experiences.
We spend too much time digging through dense reports, legal contracts, and research papers. I got tired of clunky AI readers that hallucinate or break on mobile, so I built Docmosis: a premium, autonomous document intelligence workspace
https://t.co/7XX6eF4WnD
Just shipped IntelliStudy – a full-stack RAG application that lets students chat with their PDF notes. Built with Next.js, LangGraph.js, Gemini 1.5 Flash, and Pinecone. It features real-time streaming, secure authentication with . Check it out!
https://t.co/GZcGxCQSkV
#NextJS
I just launched my personal portfolio website, showcasing my journey, skills, and projects as a developer.
Built with a modern tech stack, it's a piece of me on the internet.
Check it out and let me know what you think!
https://t.co/qbkFYrNeSh
#BuildInPublic
Solved Next Greater Element II - circular array variant using monotonic stac
The Skyline Problem - sweep line + max heap approach. Turns building coordinates into city horizons in O(n log n).
#Leetcode#algorithms#SoftwareEngineering .
We built Prashne to give you back your most valuable resource: time.
Time for human connection and strategic hires.
Ready to transform your process?
https://t.co/8LTLdGbQw6
#HRTech#Startup#Recruitment#AI
Priority queues are interview gold
2 LeetCode patterns that nail it:
Sort Characters By Frequency
Max heap + frequency counter = O(n log k)
Remove Stones to Minimize Total
Greedy + max heap = optimal solution
Heap operations beat sorting when you need repeated max/min access
Solved the "Minimum Window Substring" problem on LeetCode!
Used the sliding window technique combined with a frequency map to efficiently find the smallest substring in s containing all characters from t.
#LeetCode#Algorithm#SlidingWindow#Solved