Skip to content
Gerry's Blog

Gerry's Blog

Gerry的博客

Category: LeetCode

Posted on March 12, 2021

LeetCode 1742. Maximum Number of Balls in a Box

You are working in a ball factory where you have n balls numbered from lowLimit up to highLimit inclusive (i.e., n == highLimit – lowLimit + 1), and a[……]

Read more

Posted on March 11, 2021

LeetCode 1768. Merge Strings Alternately

You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than t[……]

Read more

Posted on March 11, 2021

LeetCode 1784. Check if Binary String Has at Most One Segment of Ones

Given a binary string s ​​​​​without leading zeros, return true​​​ if s contains at most one contiguous segment of ones. Otherwise, return false.[……]

Read more

Posted on October 18, 2020

LeetCode 1351. Count Negative Numbers in a Sorted Matrix

Given a m * n matrix grid which is sorted in non-increasing order both row-wise and column-wise.

Return the number of negative numbers in grid.[……]

Read more

Posted on October 18, 2020

LeetCode 1464. Maximum Product of Two Elements in an Array

Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1).[……]

Read more

Posted on October 18, 2020

LeetCode 980. Unique Paths III

On a 2-dimensional grid, there are 4 types of squares:

1 represents the starting square. There is exactly one starting square.
2 represents the e[……]

Read more

Posted on October 17, 2020

LeetCode 1450. Number of Students Doing Homework at a Given Time

Given two integer arrays startTime and endTime and given an integer queryTime.

The ith student started doing their homework at the time startTime[i[……]

Read more

Posted on October 17, 2020

LeetCode 1486. XOR Operation in an Array

Given an integer n and an integer start.

Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length.

Return the bitwise X[……]

Read more

Posted on October 17, 2020

LeetCode 1389. Create Target Array in the Given Order

Given two arrays of integers nums and index. Your task is to create target array under the following rules:

Initially target array is empty.
From[……]

Read more

Posted on October 17, 2020

LeetCode 1281. Subtract the Product and Sum of Digits of an Integer

Given an integer number n, return the difference between the product of its digits and the sum of its digits.

Example 1:

Input: n = 234
Outp[……]

Read more

Posts navigation

Page 1 Page 2 … Page 38 Next page

Recent Posts

  • LeetCode 1742. Maximum Number of Balls in a Box
  • LeetCode 1768. Merge Strings Alternately
  • LeetCode 1784. Check if Binary String Has at Most One Segment of Ones
  • LeetCode 1351. Count Negative Numbers in a Sorted Matrix
  • LeetCode 1464. Maximum Product of Two Elements in an Array

Recent Comments

  • 1XBET on LeetCode 1323. Maximum 69 Number
  • div-comment-49559 on LeetCode 1323. Maximum 69 Number
  • 베스트카지노 on LeetCode 1323. Maximum 69 Number
  • 실시간 바카라 on LeetCode 1323. Maximum 69 Number
  • buy CBD on LeetCode 1464. Maximum Product of Two Elements in an Array

Archives

  • March 2021
  • October 2020
  • September 2020
  • May 2020
  • March 2020
  • February 2020
  • January 2020
  • December 2019
  • November 2019
  • October 2019
  • September 2019
  • August 2019
  • July 2019
  • June 2019
  • May 2019
  • April 2019
  • March 2019
  • February 2019
  • January 2019
  • December 2018
  • November 2018

Categories

  • Google Code Jam
  • JAVA
  • LeetCode
  • MapReduce
  • MongoDB
  • Spark
  • SpringCloud
  • Uncategorized

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org

Ads

Proudly powered by WordPress