- Array - LeetCode
Copyright © 2025 LeetCode Help Center Jobs Bug Bounty Assessment Students Terms Privacy Policy United States
- Apply Operations to an Array - LeetCode
After performing all the operations, shift all the 0 's to the end of the array For example, the array [1,0,2,0,0,1] after shifting all its 0 's to the end, is [1,2,1,0,0,0]
- Explore - LeetCode
LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode No matter if you are a beginner or a master, there are always new topics waiting for you to explore
- Contiguous Array - LeetCode
Contiguous Array - Given a binary array nums, return the maximum length of a contiguous subarray with an equal number of 0 and 1 Example 1: Input: nums = [0,1] Output: 2 Explanation: [0, 1] is the longest contiguous subarray with an equal number of 0 and 1
- Find Occurrences of an Element in an Array - LeetCode
Find Occurrences of an Element in an Array - You are given an integer array nums, an integer array queries, and an integer x For each queries [i], you need to find the index of the queries [i]th occurrence of x in the nums array
- Array Partition - LeetCode
Array Partition - Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), , (an, bn) such that the sum of min (ai, bi) for all i is maximized
- Find First and Last Position of Element in Sorted Array - LeetCode
Find First and Last Position of Element in Sorted Array - Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value
- Build an Array With Stack Operations - LeetCode
Build an Array With Stack Operations - You are given an integer array target and an integer n You have an empty stack with the two following operations: * "Push": pushes an integer to the top of the stack
|