## Word Formation

Given a list of strings words and a string letters, return the length of longest string in words that can be made from letters in letters. If no word can be ...

Given a list of strings words and a string letters, return the length of longest string in words that can be made from letters in letters. If no word can be ...

Given a list of integers prices representing the stock prices of a company in chronological order, return the maximum profit you could have made from buying ...

Given a list of integers prices representing the stock prices of a company in chronological order, return the maximum profit you could have made from buying ...

Implement a boolean array which implements the following methods:

Given a binary tree root, return the number of unique vertical lines that can be drawn such that every node has a line intersecting it. Each left child is an...

Given a string s and an integer k, rearrange s into k rows so that s can be read vertically (top-down, left to right).

Given a list of integers nums, return whether it represents a max heap. That is, for every i we have that:

You are given a list of strings orders. Each element in orders starts with either "P" meaning pickup or "D" meaning delivery followed by the order id. For ex...

An upside down number is one that appears the same when flipped 180 degrees. Given n, return all upside down numbers as strings whose length is n, sorted in ...

You are given a list of integers heights representing building heights. A building heights[i] can see the ocean if every building on its right has shorter he...

Given a Unix path, represented as a list of strings, return its resolved version.

Given a binary tree root, return whether all values in the tree are the same.