870. Advantage Shuffle

Given two arrays A and B of equal size, the advantage of A with respect to B is the number of indices i for which A[i] > B[i].

923. 3Sum With Multiplicity

Given an integer array arr, and an integer target, return the number of tuples i, j, k such that i < j < k and arr[i] + arr[j] + arr[k] == target.

966. Vowel Spellchecker

Given a wordlist, we want to implement a spellchecker that converts a query word into a correct word.

869. Reordered Power of 2

Starting with a positive integer N, we reorder the digits in any order (including the original order) such that the leading digit is not zero.

1396. Design Underground System

Implement the UndergroundSystem class:

841. Keys and Rooms

There are N rooms and you start in room 0.

376. Wiggle Subsequence

Given an integer array nums, return the length of the longest wiggle sequence.

478. Generate Random Point in a Circle

Given the radius and x-y positions of the center of a circle, write a function randPoint which generates a uniform random point in the circle.

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 an integer fee representing a transaction fee.

535. Encode and Decode TinyURL

Note: This is a companion problem to the System Design problem: Design TinyURL.

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×