| 265 | Hashmaps | Hashmap Fundamentals | Contains Duplicate | LeetCode | β
ββββ | | | |
| 266 | Valid Anagram (Hashmap Approach) | LeetCode | β
ββββ | | | |
| 267 | Unique Number of Occurrences | LeetCode | β
ββββ | | | |
| 268 | Find distinct elements / Find the Frequency | GeeksForGeeks | β
ββββ | | | |
| 269 | Two Sum | LeetCode | β
β
βββ | | | |
| 270 | Intersection of Two Arrays | LeetCode | β
β
βββ | | | |
| 271 | Count Number of Pairs With Absolute Difference K | LeetCode | β
β
βββ | | | |
| 272 | Design HashMap | LeetCode | β
β
β
ββ | | | |
| 273 | Intermediate Hashmap Problems | Group Anagrams | LeetCode | β
β
β
ββ | | | |
| 274 | Longest Consecutive Sequence | LeetCode | β
β
β
ββ | | | |
| 275 | Subarray Sum Equals K | LeetCode | β
β
β
ββ | | | |
| 276 | Contiguous Array / Largest subarray with 0 sum | LeetCode | β
β
β
ββ | | | |
| 277 | Count subarrays with given XOR | GeeksForGeeks | β
β
β
ββ | | | |
| 278 | Subarray Sums Divisible by K | LeetCode | β
β
β
ββ | | | |
| 279 | Continuous Subarray Sum | LeetCode | β
β
β
ββ | | | |
| 280 | Advanced / Multi Concept | Maximum Size Subarray Sum Equals k | GeeksForGeeks | β
β
β
ββ | | | |
| 281 | Top K Frequent Elements | LeetCode | β
β
β
ββ | | | |
| 282 | LRU Cache (Least Recently Used) | LeetCode | β
β
β
β
β | | | |
| 283 | LFU Cache (Least Frequently Used) | LeetCode | β
β
β
β
β
| | | |
| ✓ Hashmaps completed — 19 questions |
| 284 | Heaps / Priority Queues | Heap Fundamentals | Check if an array represents a min heap | GeeksForGeeks | β
β
βββ | | | |
| 285 | Convert Min Heap to Max Heap | GeeksForGeeks | β
β
βββ | | | |
| 286 | Implement Min/Max Heap | Practice | β
β
β
ββ | | | |
| 287 | The Top-K Pattern | Last Stone Weight | LeetCode | β
β
β
ββ | | | |
| 288 | Kth Largest Element in an Array | LeetCode | β
β
β
β
β | | | |
| 289 | K Closest Points to Origin | LeetCode | β
β
β
β
β | | | |
| 290 | Sort a K Sorted Array / Nearly Sorted Algorithm | GeeksForGeeks | β
β
β
β
β | | | |
| 291 | Top K Frequent Elements (Heap Approach) | LeetCode | β
β
β
β
β | | | |
| 292 | Merging & Combinations | Minimum Cost of Ropes | GeeksForGeeks | β
β
β
β
β | | | |
| 293 | Merge K Sorted Lists | LeetCode | β
β
β
β
β
| | | |
| 294 | Kth Smallest Element in a Sorted Matrix | LeetCode | β
β
β
β
β | | | |
| 295 | Advanced / Two-Heaps / Scheduling | Task Scheduler | LeetCode | β
β
β
β
β
| | | |
| 296 | Reorganize String | LeetCode | β
β
β
β
β
| | | |
| 297 | Minimum Number of Refueling Stops | LeetCode | β
β
β
β
β
| | | |
| 298 | Find Median from Data Stream | LeetCode | β
β
β
β
β
| | | |
| ✓ Heaps / Priority Queues completed — 15 questions |
| 299 | Prefix Sum | 1d Prefix Sum | Running Sum of 1D Array | LeetCode | β
ββββ | | | |
| 300 | Find the Highest Altitude | LeetCode | β
β
βββ | | | |
| 301 | Find Pivot Index | LeetCode | β
β
βββ | | | |
| 302 | Range Sum Query - Immutable | LeetCode | β
β
βββ | | | |
| 303 | Product of Array Except Self | LeetCode | β
β
β
ββ | | | |
| 304 | Corporate Flight Bookings | LeetCode | β
β
β
β
β | | | |
| 305 | Trapping Rain Water (Prefix Max / Min) | LeetCode | β
β
β
β
β | | | |
| 306 | 2d Prefix Sum | Range Sum Query 2D - Immutable | LeetCode | β
β
β
ββ | | | |
| 307 | Matrix Block Sum | LeetCode | β
β
β
ββ | | | |
| 308 | Maximum Sum of a 2D Subgrid of size K x K | GeeksForGeeks | β
β
β
β
β | | | |
| ✓ Prefix Sum completed — 10 questions |
| 309 | Two Pointers & Sliding Window | Two Pointers Basics | Move Zeroes (Two Pointer Intution) | LeetCode | β
ββββ | | | |
| 310 | Valid Palindrome (Two Pointers) | LeetCode | β
ββββ | | | |
| 311 | Two Sum II - Input Array Is Sorted | LeetCode | β
β
βββ | | | |
| 312 | Sort Colors (Dutch National Flag) | LeetCode | β
β
βββ | | | |
| 313 | Container With Most Water | LeetCode | β
β
β
ββ | | | |
| 314 | 3Sum | LeetCode | β
β
β
ββ | | | |
| 315 | Fixed Size Slding Window | Maximum Average Subarray I | LeetCode | β
β
βββ | | | |
| 316 | Max Sum Subarray of size K | LeetCode | β
β
βββ | | | |
| 317 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | LeetCode | β
β
βββ | | | |
| 318 | Minimum Consecutive Cards to Pick Up | LeetCode | β
β
βββ | | | |
| 319 | Maximum Points You Can Obtain from Cards | LeetCode | β
β
β
ββ | | | |
| 320 | Variable Size Sliding Window | Find All Anagrams in a String | LeetCode | β
β
β
ββ | | | |
| 321 | Permutation in String | LeetCode | β
β
β
ββ | | | |
| 322 | Minimum Size Subarray Sum | LeetCode | β
β
β
ββ | | | |
| 323 | Longest Substring Without Repeating Characters | LeetCode | β
β
β
ββ | | | |
| 324 | Longest Repeating Character Replacement | LeetCode | β
β
β
ββ | | | |
| 325 | Max Consecutive Ones III | LeetCode | β
β
β
ββ | | | |
| 326 | Fruit Into Baskets | LeetCode | β
β
β
ββ | | | |
| 327 | Maximum Erasure Value | LeetCode | β
β
β
ββ | | | |
| 328 | Number of Substrings Containing All Three Characters | LeetCode | β
β
β
ββ | | | |
| 329 | Advanced Sliding Window / Counting / Atmost K | Binary Subarrays With Sum | LeetCode | β
β
β
ββ | | | |
| 330 | Count Number of Nice Subarrays | LeetCode | β
β
β
ββ | | | |
| 331 | Subarrays with K Different Integers | LeetCode | β
β
β
β
β | | | |
| 332 | Minimum Window Subsequence | LeetCode | β
β
β
β
β | | | |
| 333 | Minimum Window Substring | LeetCode | β
β
β
β
β
| | | |
| ✓ Two Pointers & Sliding Window completed — 25 questions |
| 334 | Bit Manipulation | Bit Basics & Properties | K-th Bit is Set or Not | GeeksForGeeks | β
ββββ | | | |
| 335 | Check if a Number is Odd or Not | GeeksForGeeks | β
ββββ | | | |
| 336 | Check If Number Power of 2 or Not | LeetCode | β
β
βββ | | | |
| 337 | Number Of Even and Odd Bits | LeetCode | β
β
βββ | | | |
| 338 | Minimum Bit Flips To Convert Number | LeetCode | β
β
β
ββ | | | |
| 339 | XOR Tricks | Swap Two Numbers (XOR Trick) | GeeksForGeeks | β
β
βββ | | | |
| 340 | Single Number I | LeetCode | β
β
βββ | | | |
| 341 | Is Binary Number Multiple of 3 | GeeksForGeeks | β
β
βββ | | | |
| 342 | Find the repeating and missing number | LeetCode | β
β
β
ββ | | | |
| 343 | Single Number II | LeetCode | β
β
β
β
β | | | |
| 344 | Single Number III | LeetCode | β
β
β
β
β
| | | |
| 345 | Bit Counting & Advanced | Count Set Bits From 1 to N | GeeksForGeeks | β
β
β
β
β | | | |
| 346 | Bleak Numbers | GeeksForGeeks | β
β
β
β
β | | | |
| 347 | Minimum Xor Pair | GeeksForGeeks | β
β
β
β
β | | | |
| 348 | Divide Two Integers (Bit Shifting) | LeetCode | β
β
β
β
β | | | |
| ✓ Bit Manipulation completed — 15 questions |