Hhimanshu·Feb 7Day 6 - Encode and Decode StringsLearn how to encode and decode string arrays efficiently, ensuring data integrity for network transmission with O(n) complexity3 min read·blogs-himanshu.hashnode.dev
Hhimanshu·Feb 7Day 5 - Top K Frequent ElementsFind the k most frequent elements in an integer array using hash table and min heap2 min read·blogs-himanshu.hashnode.dev
Hhimanshu·Feb 4Day 3 - Two SumFind indices of two numbers in an array that add up to a target using two approaches: nested loops and hash table3 min read·blogs-himanshu.hashnode.dev
Hhimanshu·Feb 3Day 2 - Valid AnagramCheck if two strings are anagrams using hash tables for efficient character counting and comparison3 min read·blogs-himanshu.hashnode.dev
Hhimanshu·Feb 2Day 1 - Contains DuplicateDetermine if an integer array contains duplicates with a simple array-based JavaScript solution using O(n) time complexity2 min read·blogs-himanshu.hashnode.dev
RRajkumar Verma·Nov 1, 2025Jio giving free Gemini pro for All Jio Userjio giveing free gemini pro and to claim read this guide1 min read·blog.socailsaver.app
AAnni Huang·Aug 5, 2025LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))Unavoidable O(n²) - Optimal Solution in Python, Java, Golang, C, C#, C++4 min read·huanganni.hashnode.dev
AAnni Huang·Jul 22, 2025LeetCode 1695-Maximum Erasure Value(Med, Java, O(n))Problem Description 1695. Maximum Erasure Value This problem asks us to find the maximum sum of a contiguous subarray where all elements are unique (no duplicates). We need to identify the subarray with unique elements that has the largest sum and ...3 min read·huanganni.hashnode.dev
AAnni Huang·Jul 20, 2025LeetCode Daily Challenge-LeetCode 1948 Delete Duplicate Folders in System-Two Solutions(Hard, Java)Problem Understanding LeetCode 1948-Delete Duplicate Folders in System The goal is to delete all duplicate folder subtrees. Two folders are considered duplicates if they have the same structure and folder names in their subtrees. Solution 1: Standa...6 min read·huanganni.hashnode.dev
AAnni Huang·Jul 19, 2025LeetCode Daily Challenge-1233. Remove Sub-Folders from the Filesystem(Med, Java)Two solutions: Sorting+Prefix Check vs Trie (Prefix Tree) TC: both O(n log n + n·m) SC: O(1) vs O(n·m)3 min read·huanganni.hashnode.dev