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
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
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
Sudoku Solver - LeetCode Can you solve this real interview question? Sudoku Solver - Write a program to solve a Sudoku puzzle by filling the empty cells A sudoku solution must satisfy all of the following rules: 1 Each of the digits 1-9 must occur exactly once in each row 2 Each of the digits 1-9 must occur exactly once in each column 3 Each of the digits 1-9 must occur exactly once in each of the 9 3x3 sub
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
Rotate List - LeetCode 1 Please don't post any solutions in this discussion 2 The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions 3 If you'd like to share your solution for feedback and ideas, please head to the solutions tab and post it there
Assign Cookies - LeetCode Can you solve this real interview question? Assign Cookies - Assume you are an awesome parent and want to give your children some cookies But, you should give each child at most one cookie Each child i has a greed factor g[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s[j] If s[j] >= g[i], we can assign the cookie j to the child
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