Robina Li

Given an array of meeting time intervals where intervals[i] = [starti, endi], determine if a person could attend all meetings.

There are n flights labeled from 1 to n. You are given an array of flight bookings where bookings[i] = [firsti, lasti, seatsi] represents a booking for flights firsti through...

There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city...

You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi,...

Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k.

This is an interactive problem.

Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.

Given an integer array nums and an integer k, return the maximum length of a subarray that sums to k. If there is no such subarray, return 0.

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*' where:

Design a time-based key-value data structure that can store multiple values for the same key at different timestamps and retrieve the key’s value at a certain timestamp.