381. Insert Delete GetRandom O(1) - Duplicates allowed

Problem description:

Implement the RandomizedCollection class:

Readmore

1636. Sort Array by Increasing Frequency

Problem description:

Given an array of integers nums, sort the array in increasing order based on the frequency of the values. If multiple values have the same frequency, sort them in decreasing order.

Readmore

974. Subarray Sums Divisible by K

Problem description:

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

Readmore

938. Range Sum of BST

Problem description:

Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high].

Readmore

498. Diagonal Traverse

Problem description:

Given an m x n matrix mat, return an array of all the elements of the array in a diagonal order.

Readmore

1235. Maximum Profit in Job Scheduling

Problem description:

We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].

Readmore

1229. Meeting Scheduler

Problem description:

Given the availability time slots arrays slots1 and slots2 of two people and a meeting duration duration, return the earliest time slot that works for both of them and is of duration duration.

Readmore

759. Employee Free Time

Problem description:

We are given a list schedule of employees, which represents the working time for each employee.

Readmore

1359. Count All Valid Pickup and Delivery Options

Problem description:

Given n orders, each order consist in pickup and delivery services.

Readmore

323. Number of Connected Components in an Undirected Graph

Problem description:

You have a graph of n nodes. You are given an integer n and an array edges where edges[i] = [ai, bi] indicates that there is an edge between ai and bi in the graph.

Readmore