Day 179 medium

    1514. Path with Maximum Probability

    You are given an undirected weighted graph of n nodes (0-indexed), represented by an edge list where edges[i] = [a,...
    Day 178 medium

    373. Find K Pairs with Smallest Sums

    You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k. Define a pair...
    Day 177 medium

    2462. Total Cost to Hire K Workers

    You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker. You are...
    Day 176

    1575. Count All Possible Routes

    You are given an array of distinct positive integers locations where locations[i] represents the position of city i. You are...
    Day 175 hard

    956. Tallest Billboard

    You are installing a billboard and want it to have the largest height. The billboard will have two steel supports,...
    Day 174 medium

    1027. Longest Arithmetic Subsequence

    Given an array nums of integers, return the length of the longest arithmetic subsequence in nums. Note that: A subsequence...
    Day 173 medium

    714. Best Time to Buy and Sell Stock with Transaction Fee

    You are given an array prices where prices[i] is the price of a given stock on the ith day, and...
    Day 172 hard

    2448. Minimum Cost to Make Array Equal

    You are given two 0-indexed arrays nums and cost consisting each of n positive integers. You can do the following...
    Day 171 medium

    2090. K Radius Subarray Averages

    You are given a 0-indexed array nums of n integers, and an integer k. The k-radius average for a subarray...
    Day 170 easy

    1732. Find the Highest Altitude

    There is a biker going on a road trip. The road trip consists of n + 1 points at different...
    Day 169 hard

    2328. Number of Increasing Paths in a Grid

    You are given an m x n integer matrix grid, where you can move from a cell to any adjacent...
    Day 168 hard

    1187. Make Array Strictly Increasing

    Given two integer arrays arr1 and arr2, return the minimum number of operations (possibly zero) needed to make arr1 strictly...
    Day 167 hard

    1569. Number of Ways to Reorder Array to Get Same BST

    Given an array nums that represents a permutation of integers from 1 to n. We are going to construct a...
    Day 166 medium

    1161. Maximum Level Sum of a Binary Tree

    Given the root of a binary tree, the level of its root is 1, the level of its children is...
    Day 165 easy

    530. Minimum Absolute Difference in BST

    Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two...
    Day 164 medium

    2352. Equal Row and Column Pairs

    Given a 0-indexed n x n integer matrix grid, return the number of pairs (ri, cj) such that row ri...
    Day 163 easy

    228. Summary Ranges

    You are given a sorted unique integer array nums. A range [a,b] is the set of all integers from a...
    Day 162 medium

    1146. Snapshot Array

    Implement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the given length. Initially,...
    Day 161 medium

    1802. Maximum Value at a Given Index in a Bounded Array

    You are given three positive integers: n, index, and maxSum. You want to construct an array nums (0-indexed) that satisfies...
    Day 160 easy

    744. Find Smallest Letter Greater Than Target

    You are given an array of characters letters that is sorted in non-decreasing order, and a character target. There are...
    Day 159 easy

    1351. Count Negative Numbers in a Sorted Matrix

    Given a m x n matrix grid which is sorted in non-increasing order both row-wise and column-wise, return the number...
    Day 158 medium

    1318. Minimum Flips to Make a OR b Equal to c

    Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b...
    Day 157 easy

    1502. Can Make Arithmetic Progression From Sequence

    A sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is the same....
    Day 156 easy

    1232. Check If It Is a Straight Line

    You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point. Check...
    Day 155 medium

    547. Number of Provinces

    There are n cities. Some of them are connected, while some are not. If city a is connected directly with...
    Day 154 medium

    1376. Time Needed to Inform All Employees

    A company has n employees with a unique ID for each employee from 0 to n - 1. The head...
    Day 153 medium

    2101. Detonate the Maximum Bombs

    You are given a list of bombs. The range of a bomb is defined as the area where its effect...
    Day 152 medium

    1091. Shortest Path in Binary Matrix

    Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If...
    Day 151 medium

    1396. Design Underground System

    An underground railway system is keeping track of customer travel times between different stations. They are using this data to...
    Day 150 easy

    705. Design HashSet

    Design a HashSet without using any built-in hash table libraries. Implement MyHashSet class: void add(key) Inserts the value key into...