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
Contest - LeetCode Enhance your coding abilities and get valuable real-world feedback by participating in contests on LeetCode You can also win up to 5000 LeetCoins per contest, as well as bonus prizes from sponsored companies
Account Login - LeetCode Level up your coding skills and quickly land a job This is the best place to expand your knowledge and get prepared for your next interview
Study Plan - LeetCode Enhance your coding skills and prepare for job interviews with LeetCode's study plans
Array - LeetCode Level up your coding skills and quickly land a job This is the best place to expand your knowledge and get prepared for your next interview
Login - LeetCode Login to LeetCode Online Interview Login with LeetCode account or register
Find the Smallest Balanced Index - LeetCode Can you solve this real interview question? Find the Smallest Balanced Index - You are given an integer array nums An index i is balanced if the sum of elements strictly to the left of i equals the product of elements strictly to the right of i If there are no elements to the left, the sum is considered as 0 Similarly, if there are no elements to the right, the product is considered as 1
3Sum - LeetCode Can you solve this real interview question? 3Sum - Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j
Concatenation of Array - LeetCode Can you solve this real interview question? Concatenation of Array - Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed) Specifically, ans is the concatenation of two nums arrays Return the array ans Example 1: Input: nums = [1,2,1] Output: [1,2,1,1,2,1] Explanation: The array ans