All Posts

Leetcode 1684: Count the Number of Consistent Strings

You are given a string allowed consisting of distinct characters, and an array of strings words. A string is consistent if all characters in the string appear in the string allowed. Return the number of consistent strings in the array words.

May 22, 2024 - 5 min read

Leetcode 1704: Determine if String Halves Are Alike

You are given a string ’s’ of even length. Split the string into two equal halves, where the first half is ‘a’ and the second half is ‘b’.

Two strings are considered alike if they contain the same number of vowels (a, e, i, o, u, A, E, I, O, U). Return ’true’ if ‘a’ and ‘b’ are alike, otherwise return ‘false’.

May 20, 2024 - 6 min read

Leetcode 1726: Tuple with Same Product

You are given an array of distinct positive integers nums. Your task is to count how many tuples (a, b, c, d) exist such that the product of a * b equals the product of c * d, where a, b, c, d are distinct elements of nums and a != b != c != d.

May 18, 2024 - 6 min read

Leetcode 1737: Change Minimum Characters to Satisfy One of Three Conditions

You are given two strings, a and b, consisting of lowercase letters. In one operation, you can change any character in either string to any lowercase letter. Your goal is to perform the minimum number of operations to satisfy one of the following three conditions:

  1. Every character in string a is strictly less than every character in string b alphabetically.
  2. Every character in string b is strictly less than every character in string a alphabetically.
  3. Both a and b consist of only one distinct character.

Return the minimum number of operations needed to achieve one of these conditions.

May 17, 2024 - 8 min read

Leetcode 1742: Maximum Number of Balls in a Box

You are working in a ball factory with n balls numbered from lowLimit to highLimit (inclusive). You have an infinite number of boxes numbered from 1 to infinity. Your task is to place each ball into the box where the box number equals the sum of the digits of the ball’s number. For example, a ball numbered 321 will go into box 6 (since 3 + 2 + 1 = 6), and a ball numbered 10 will go into box 1 (since 1 + 0 = 1). The goal is to find the box with the most balls and return the number of balls in that box.

May 16, 2024 - 5 min read

Leetcode 1748: Sum of Unique Elements

You are given an integer array nums. Your task is to find the sum of all elements that appear only once in the array. Elements that appear more than once should be excluded from the sum.

May 16, 2024 - 5 min read