You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
| 0215 |[Kth Largest Element in an Array](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 9 | 97.67
| 0295 |[Find Median from Data Stream](src/main/js/g0201_0300/s0295_find_median_from_data_stream/solution.js)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n\*log_n)_Space_O(n) | 97 | 98.11
1408
+
| 0295 |[Find Median from Data Stream](src/main/js/g0201_0300/s0295_find_median_from_data_stream/solution.js)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n\*log_n)_Space_O(n) | 134 | 76.00
1394
1409
| 0287 |[Find the Duplicate Number](src/main/js/g0201_0300/s0287_find_the_duplicate_number/solution.js)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Binary_Search_II_Day_5, Big_O_Time_O(n)_Space_O(n) | 1 | 99.54
You are given an integer array `coins` representing coins of different denominations and an integer `amount` representing a total amount of money.
6
+
7
+
Return _the fewest number of coins that you need to make up that amount_. If that amount of money cannot be made up by any combination of the coins, return `-1`.
8
+
9
+
You may assume that you have an infinite number of each kind of coin.
Given an integer `n`, return _an array_`ans`_of length_`n + 1`_such that for each_`i` (`0 <= i <= n`)_,_`ans[i]`_is the **number of**_`1`_**'s** in the binary representation of_`i`.
6
+
7
+
**Example 1:**
8
+
9
+
**Input:** n = 2
10
+
11
+
**Output:**[0,1,1]
12
+
13
+
**Explanation:**
14
+
15
+
0 --> 0
16
+
1 --> 1
17
+
2 --> 10
18
+
19
+
**Example 2:**
20
+
21
+
**Input:** n = 5
22
+
23
+
**Output:**[0,1,1,2,1,2]
24
+
25
+
**Explanation:**
26
+
27
+
0 --> 0
28
+
1 --> 1
29
+
2 --> 10
30
+
3 --> 11
31
+
4 --> 100
32
+
5 --> 101
33
+
34
+
**Constraints:**
35
+
36
+
* <code>0 <= n <= 10<sup>5</sup></code>
37
+
38
+
**Follow up:**
39
+
40
+
* It is very easy to come up with a solution with a runtime of `O(n log n)`. Can you do it in linear time `O(n)` and possibly in a single pass?
41
+
* Can you do it without using any built-in function (i.e., like `__builtin_popcount` in C++)?
Given an encoded string, return its decoded string.
6
+
7
+
The encoding rule is: `k[encoded_string]`, where the `encoded_string` inside the square brackets is being repeated exactly `k` times. Note that `k` is guaranteed to be a positive integer.
8
+
9
+
You may assume that the input string is always valid; there are no extra white spaces, square brackets are well-formed, etc. Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, `k`. For example, there will not be input like `3a` or `2[4]`.
10
+
11
+
The test cases are generated so that the length of the output will never exceed <code>10<sup>5</sup></code>.
12
+
13
+
**Example 1:**
14
+
15
+
**Input:** s = "3[a]2[bc]"
16
+
17
+
**Output:** "aaabcbc"
18
+
19
+
**Example 2:**
20
+
21
+
**Input:** s = "3[a2[c]]"
22
+
23
+
**Output:** "accaccacc"
24
+
25
+
**Example 3:**
26
+
27
+
**Input:** s = "2[abc]3[cd]ef"
28
+
29
+
**Output:** "abcabccdcdcdef"
30
+
31
+
**Constraints:**
32
+
33
+
*`1 <= s.length <= 30`
34
+
*`s` consists of lowercase English letters, digits, and square brackets `'[]'`.
35
+
*`s` is guaranteed to be **a valid** input.
36
+
* All the integers in `s` are in the range `[1, 300]`.
Given a **non-empty** array `nums` containing **only positive integers**, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
6
+
7
+
**Example 1:**
8
+
9
+
**Input:** nums = [1,5,11,5]
10
+
11
+
**Output:** true
12
+
13
+
**Explanation:** The array can be partitioned as [1, 5, 5] and [11].
14
+
15
+
**Example 2:**
16
+
17
+
**Input:** nums = [1,2,3,5]
18
+
19
+
**Output:** false
20
+
21
+
**Explanation:** The array cannot be partitioned into equal sum subsets.
0 commit comments