Algorithm This week’s LeetCode problem is 380. Insert Delete GetRandom O(1) Implement the RandomizedSet class: RandomizedSet() Initializes the RandomizedSet object. bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise. bool remove(int val) Removes an item val from…

Algorithm This week’s LeetCode problem is 162. Find Peak Element A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You…

Algorithm This week’s LeetCode problem is 334. Increasing Triplet Subsequence Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false. Input: nums = [1,2,3,4,5] Output…

Algorithm This week’s LeetCode problem is 347. Top K Frequent Elements Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] First traverse the array once, and use Map…

Algorithm This week's LeetCode problem is 328. Odd Even Linked List Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list. The first node is considered odd, and the second node is even…

Algorithm This week’s LeetCode problem is 215. Kth Largest Element in an Array Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not the kth distinct element. The kth largest element…

Algorithm This week’s LeetCode problem is 371. Sum of Two Integers Given two integers a and b, return the sum of the two integers without using the operators + and -. Input: a = 1, b = 2 Output: 3 The four cases according to the addition of two binary bits…

Algorithm This week’s LeetCode problem is 69. Sqrt(x) Given a non-negative integer x, compute and return the square root of x. Since the return type is an integer, the decimal digits are truncated, and only the integer part of the result is returned. Note: You are not allowed to use any…

Algorithm This week’s LeetCode problem is 50. Pow(x, n) Implement pow(x, n), which calculates x raised to the power n (i.e., xn). Input：x = 2.00000, n = 10 Output：1024.00000 Input：x = 2.00000, n = -2 Output：0.25000 Explanation：2^-2 = (1/2)^2 = 1/4 = 0.25 In order to use the dichotomy method, it…