2161. Partition Array According to Given Pivot
2161. Partition Array According to Given Pivot
Description
You are given a 0-indexed integer array nums and an integer pivot. Rearrange nums such that the following conditions are satisfied:
279. Perfect Squares
24. Swap Nodes in Pairs
502. IPO
Description
Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the IPO . Since it has limited resources, it can only finish at most k distinct projects before the IPO . Help LeetCode design the best way to maximize its total capital after finishing at most k distinct projects.
540. Single Element in a Sorted Array
540. Single Element in a Sorted Array
Description
You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.
205. Isomorphic Strings
12. Integer to Roman
1466. Reorder Routes to Make All Paths Lead to the City Zero
1466. Reorder Routes to Make All Paths Lead to the City Zero
Description
There are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this network form a tree). Last year, The ministry of transport decided to orient the roads in one direction because they are too narrow.
1135. Connecting Cities With Minimum Cost
1135. Connecting Cities With Minimum Cost
Description
There are n cities labeled from 1 to n. You are given the integer n and an array connections where connections[i] = [xi, yi, costi] indicates that the cost of connecting city xi and city yi (bidirectional connection) is costi.