Tag feed

#leetcode-easy

13 posts0 followers

Explore Hashnode

Alternatives

Trending tags this week

AHAnni Huanghuanganni.hashnode.devAug 5, 2025 · 4 min read

LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))

Problem Statement You are given two arrays fruits and baskets of equal length n. Place fruits into baskets following these rules: Each fruit type must be placed in the leftmost available basket with sufficient capacity Each basket holds only one typ...

0

AHAnni Huanghuanganni.hashnode.devJul 27, 2025 · 4 min read

LeetCode Daily Challenge-2210 Count Hills and Valleys in an Array(Easy, Two Pointers, O(n))

Problem Description LeetCode 2210 asks us to count the number of hills and valleys in an array. A hill is an element that is strictly greater than its neighbors, while a valley is an element that is strictly smaller than its neighbors. The key challe...

0

AHAnni Huanghuanganni.hashnode.devJul 13, 2025 · 5 min read

LeetCode 160 Intersection of Two Linked Lists - Four Complete Solutions (Easy, Java, O(n))

Problem Description LeetCode 160: Intersection of Two Linked Lists Given the heads of two singly linked lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null. The l...

0

AHAnni Huanghuanganni.hashnode.devJul 12, 2025 · 4 min read

LeetCode 2006 Count Number of Pairs With Absolute Difference K - From brute force O(n²) to optimal O(n) using frequency array (Easy, Java, O(n))

Problem Description LeetCode 2006 Count Number of Pairs With Absolute Difference K Given a 0-indexed integer array nums, return true if it can be made strictly increasing after removing exactly one element, or false otherwise. If the array is already...

0

AHAnni Huanghuanganni.hashnode.devJul 12, 2025 · 4 min read

LeetCode 1909. Remove One Element to Make the Array Strictly Increasing - Optimal solution by analyzing possible cases and find patterns (Java, O(n))

Problem Description LeetCode 1909: Remove One Element to Make the Array Strictly Increasing Given a 0-indexed integer array nums, return true if it can be made strictly increasing after removing exactly one element, or false otherwise. If the array...

0

AHAnni Huanghuanganni.hashnode.devJul 10, 2025 · 3 min read

LeetCode 232 Implement Queue using Stacks - by using two stacks (Easy, Java)

232. Implement Queue using Stacks To implement a queue (FIFO) using two stacks, we need to simulate the first-in-first-out behavior. The key idea is to use one stack (stack1) for pushing elements and another stack (stack2) for popping/peeking. When w...

0

AHAnni Huanghuanganni.hashnode.devJul 10, 2025 · 4 min read

LeetCode 326 Power of Three - Step by Step Breakdown(Easy, Java, O(n))

LeetCode 326. Power of Three This code determines whether a given integer n is a power of three. A power of three is any integer that can be expressed as (3^k) where (k) is a non-negative integer (e.g., (3^0 = 1), (3^1 = 3), (3^2 = 9), etc.). Step-b...

0

AHAnni Huanghuanganni.hashnode.devJul 9, 2025 · 4 min read

Leetcode 706 Design HashMap - How HashMap is Implemented in Java (Easy, O(n))

Leetcode 706: Design HashMap Problem Summary – Leetcode 706: Design HashMap You're asked to implement a basic HashMap data structure that supports: put(key, value) — insert/update a key-value pair. get(key) — retrieve the value by key; return -1 if ...

0

AHAnni Huanghuanganni.hashnode.devJul 6, 2025 · 5 min read

121. Best Time to Buy and Sell Stock(Java, Easy, O(n))

LeetCode 121: Best Time to Buy and Sell Stock Problem Statement You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a dif...

0

AHAnni Huanghuanganni.hashnode.devJul 4, 2025 · 5 min read

LeetCode Daily Challenge-3330. Find the Original Typed String I(Easy)

LeetCode Link Date: 1st July 2025 Topics: String Problem Understanding LeetCode 3330: Find the Original Typed String I presents a relatable scenario: Alice accidentally holds keys too long while typing, causing characters to repeat. The key constrai...

0

#leetcode-easy

Search Hashnode

#leetcode-easy

Explore Hashnode

Trending tags this week

LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))

LeetCode Daily Challenge-2210 Count Hills and Valleys in an Array(Easy, Two Pointers, O(n))

LeetCode 160 Intersection of Two Linked Lists - Four Complete Solutions (Easy, Java, O(n))

LeetCode 2006 Count Number of Pairs With Absolute Difference K - From brute force O(n²) to optimal O(n) using frequency array (Easy, Java, O(n))

LeetCode 1909. Remove One Element to Make the Array Strictly Increasing - Optimal solution by analyzing possible cases and find patterns (Java, O(n))

LeetCode 232 Implement Queue using Stacks - by using two stacks (Easy, Java)

LeetCode 326 Power of Three - Step by Step Breakdown(Easy, Java, O(n))

Leetcode 706 Design HashMap - How HashMap is Implemented in Java (Easy, O(n))

121. Best Time to Buy and Sell Stock(Java, Easy, O(n))

LeetCode Daily Challenge-3330. Find the Original Typed String I(Easy)