Author: ACMer
Given two arrays nums1 and nums2. Return the maximum dot product between non-empty subsequences of nums1 and nums2 with the same length. A subsequence of a array is a …
Given the head of a linked list and two integers m and n. Traverse the linked list and remove some nodes in the following way: Start with the head …
Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “_” is a single digit. The “_” may not be the same digit. If it is …
A binary tree is given such that each node contains an additional random pointer which could point to any node in the tree or null. Return a deep copy …
Given an array nums. We define a running sum of an array as runningSum = sum(nums…nums). Return the running sum of nums. Example 1: Input: nums = Output: Explanation: …
