ruihuang888

def max_power(fields, towers):
    # Initialize two pointers 'i' and 'j' to traverse both the 'fields' and 'towers' lists respectively.
    i = j = 0
    # Initialize a variable 'max_distance' to store the maximum distance between a field and a tower.
    max_distance = 0
    # Run a loop until either of the two pointers reaches the end of its respective list.
    while i < len(fields) and j < len(towers):
        # Calculate the absolute difference between the current field and tower.
        curr_distance = abs(fields[i] - towers[j])
        # Update 'max_distance' with the maximum value of the current difference and the existing 'max_distance'.

ruihuang888

def maxA(N: int) -> int:
    # Create an array to store the maximum number of As that can be printed
    # in each step
    dp = [0] * (N + 1)
    
    # Fill the dp array
    for i in range(1, N + 1):
        # In the first step, we can print only 1 'A'
        dp[i] = dp[i-1] + 1
        for j in range(i-3, 0, -1):

ruihuang888

# Function to find the first number of teaspoons of sugar that will make the cake too sweet
def find_x(n, isTooSweet):
    # Set the lower bound to be 1 teaspoon
    lower = 1
    # Set the upper bound to be n teaspoons
    upper = n
    
    # Repeat until lower bound and upper bound converge to the same value
    while lower < upper:
        # Find the middle value between the lower and upper bound

ruihuang888

Array

• Two Sum
• Best Time to Buy and Sell Stock
• Contains Duplicate
• Product of Array Except Self
• Maximum Subarray
• Maximum Product Subarray
• Find Minimum in Rotated Sorted Array