알고리즘

[LeetCode] Duplicate Zeros (Python)

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. leetcode.com Problem Given a fixed-length integer array arr, duplicate each occurrence of zero, shifting the remaining elements to the right. solution class Solution: def duplicateZero..

[LeetCode] Squares of a Sorted Array (Python)

Problem Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. Example 1: Input : nums = [-4,-1,0,3,10] Output : [0,1,9,16,100] Explanation After squaring, the array becomes [16,1,0,9,100]. After sorting, it becomes [0,1,9,16,100]. Constraints: 1

[LeetCode] Find Numbers with Even Number of Digits (Python)

Problems Given an array nums of integers, return how many of them contain an even number of digits. Example 1: Input : nums = [12,345,2,6,7896] Output : 2 Explanation 12 contains 2 digits (even number of digits). 345 contains 3 digits (odd number of digits). 2 contains 1 digit (odd number of digits). 6 contains 1 digit (odd number of digits). 7896 contains 4 digits (even number of digits). There..

[LeetCode] Max Consecutive Ones (Python)

Problems Given a binary array nums, return the maximum number of consecutive 1's in the array. Example 1: Input: nums = [1,1,0,1,1,1] Output : 3 Explanation The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3. Constraints: 1