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.

1721. Swapping Nodes in a Linked List

You are given the head of a linked list, and an integer k.

823. Binary Trees With Factors

Given an array of unique integers, arr, where each integer arr[i] is strictly greater than 1.

1461. Check If a String Contains All Binary Codes of Size K

Given a binary string s and an integer k.

Your browser is out-of-date!

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

×