---
title: "#daily-leetcode-challenge articles | Hashnode"
description: "Explore 101 articles tagged #daily-leetcode-challenge on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/daily-leetcode-challenge"
---

Tag

# #daily-leetcode-challenge

101 posts · 10 followers

[himanshu](https://hashnode.com/@Himanshu-) · [Feb 7](https://hashnode.com/posts/day-6-encode-and-decode-strings/6986fce9564c709fdffbdf29)

### [Day 6 - Encode and Decode Strings](https://blogs-himanshu.hashnode.dev/day-6-encode-and-decode-strings?utm_source=hashnode&utm_medium=feed)

Learn how to encode and decode string arrays efficiently, ensuring data integrity for network transmission with O(n) complexity

3 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-6-encode-and-decode-strings?utm_source=hashnode&utm_medium=feed)

[himanshu](https://hashnode.com/@Himanshu-) · [Feb 7](https://hashnode.com/posts/day-5-top-k-frequent-elements/6986d7c3c2f80acbea9f5134)

### [Day 5 - Top K Frequent Elements](https://blogs-himanshu.hashnode.dev/day-5-top-k-frequent-elements?utm_source=hashnode&utm_medium=feed)

Find the k most frequent elements in an integer array using hash table and min heap

2 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-5-top-k-frequent-elements?utm_source=hashnode&utm_medium=feed)

[himanshu](https://hashnode.com/@Himanshu-) · [Feb 4](https://hashnode.com/posts/day-3-two-sum/6982faa247c9cf9080d39768)

### [Day 3 - Two Sum](https://blogs-himanshu.hashnode.dev/day-3-two-sum?utm_source=hashnode&utm_medium=feed)

Find indices of two numbers in an array that add up to a target using two approaches: nested loops and hash table

3 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-3-two-sum?utm_source=hashnode&utm_medium=feed)

[himanshu](https://hashnode.com/@Himanshu-) · [Feb 3](https://hashnode.com/posts/day-2-valid-anagram/69819baaa41db4603bc76971)

### [Day 2 - Valid Anagram](https://blogs-himanshu.hashnode.dev/day-2-valid-anagram?utm_source=hashnode&utm_medium=feed)

Check if two strings are anagrams using hash tables for efficient character counting and comparison

3 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-2-valid-anagram?utm_source=hashnode&utm_medium=feed)

[himanshu](https://hashnode.com/@Himanshu-) · [Feb 2](https://hashnode.com/posts/day-1-contains-duplicate/69805e7f09b2fc1467e69536)

### [Day 1 - Contains Duplicate](https://blogs-himanshu.hashnode.dev/day-1-contains-duplicate?utm_source=hashnode&utm_medium=feed)

Determine if an integer array contains duplicates with a simple array-based JavaScript solution using O(n) time complexity

2 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-1-contains-duplicate?utm_source=hashnode&utm_medium=feed)

[Rajkumar Verma](https://hashnode.com/@rajkumarprince) · [Nov 1, 2025](https://hashnode.com/posts/jio-giving-free-gemini-pro-for-all-jio-user/690576d57c6ab6b2fc4c5c7a)

### [Jio giving free Gemini pro for All Jio User](https://blog.socailsaver.app/jio-giving-free-gemini-pro-for-all-jio-user?utm_source=hashnode&utm_medium=feed)

jio giveing free gemini pro and to claim read this guide

1 min read · [blog.socailsaver.app](https://blog.socailsaver.app/jio-giving-free-gemini-pro-for-all-jio-user?utm_source=hashnode&utm_medium=feed)

[Anni Huang](https://hashnode.com/@HuangAnni) · [Aug 5, 2025](https://hashnode.com/posts/leetcode-daily-challenge-3477-fruits-into-baskets-iieasy-on/68917ae6f2dbd648272e4d13)

### [LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))](https://huanganni.hashnode.dev/leetcode-daily-challenge-3477-fruits-into-baskets-iieasy-on?utm_source=hashnode&utm_medium=feed)

Unavoidable O(n²) - Optimal Solution in Python, Java, Golang, C, C#, C++

4 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-daily-challenge-3477-fruits-into-baskets-iieasy-on?utm_source=hashnode&utm_medium=feed)

[Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 22, 2025](https://hashnode.com/posts/leetcode-1695-maximum-erasure-valuemed-java-on/687fa9dc179cdbbf6a7f3846)

### [LeetCode 1695-Maximum Erasure Value(Med, Java, O(n))](https://huanganni.hashnode.dev/leetcode-1695-maximum-erasure-valuemed-java-on?utm_source=hashnode&utm_medium=feed)

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](https://huanganni.hashnode.dev/leetcode-1695-maximum-erasure-valuemed-java-on?utm_source=hashnode&utm_medium=feed)

[Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 20, 2025](https://hashnode.com/posts/leetcode-daily-challenge-leetcode-1948-delete-duplicate-folders-in-system-two-solutionshard-java/687cefe8f3f849c27f8d1a3d)

### [LeetCode Daily Challenge-LeetCode 1948 Delete Duplicate Folders in System-Two Solutions(Hard, Java)](https://huanganni.hashnode.dev/leetcode-daily-challenge-leetcode-1948-delete-duplicate-folders-in-system-two-solutionshard-java?utm_source=hashnode&utm_medium=feed)

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](https://huanganni.hashnode.dev/leetcode-daily-challenge-leetcode-1948-delete-duplicate-folders-in-system-two-solutionshard-java?utm_source=hashnode&utm_medium=feed)

[Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 19, 2025](https://hashnode.com/posts/leetcode-daily-challenge-1233-remove-sub-folders-from-the-filesystemmed-java/687b7db405fba4a367914d71)

### [LeetCode Daily Challenge-1233. Remove Sub-Folders from the Filesystem(Med, Java)](https://huanganni.hashnode.dev/leetcode-daily-challenge-1233-remove-sub-folders-from-the-filesystemmed-java?utm_source=hashnode&utm_medium=feed)

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](https://huanganni.hashnode.dev/leetcode-daily-challenge-1233-remove-sub-folders-from-the-filesystemmed-java?utm_source=hashnode&utm_medium=feed)
