pranay180825.hashnode.devEveryone uses a HashSet for LeetCode 961. I found a way to use O(1) space by hacking Moore's Voting Algorithm. Here is the math behind it.LeetCode 961: N-Repeated Element in Size 2N Array is usually solved with a simple Hash Set (O(N) space) or randomized checks. But recently, I challenged myself to solve it deterministically using O(1) space. The result? A modified version of Moore’s ...Jan 2·3 min read
pranay180825.hashnode.devMastering Priority System DesignIn the recent few days the daily leetcode questions were from the topic of Priority Queue where we were needed to arrange elements in a particular order it may time, rating or let's day price why not With decent practice of Priority Queue, I tried to...Sep 19, 2025·2 min read
pranay180825.hashnode.devPRANAY's 1st September 2025After a long and exhausting time at the college and at my club Innogeeks where I am now a coordinator, I decided to solve some question on leetcode and study some tropics which would improve my logical thinking and ability to solve questions Maximum ...Sep 2, 2025·3 min read
pranay180825.hashnode.devPRANAY's 18th August 2025Today after a hectic day at college I solved the TLE ELIMINATOR CP-31 sheet which is a great resource for any one who want to have a taste of CP with Leetcode The fifth Question TLE CP-31 was Jagged Swaps—>My take on this was that it might be a good ...Aug 20, 2025·2 min read