Leet Code :Running Sum of 1d Array Solution C++ || Python || Java
Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums =…
// category archive
Learn and practice the data structure and algorithm with C++ Programming language
60 articles
Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums =…
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1: Input: nums1 =…
Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: nums = [1,2,3,4,5,6,7], k = 3 Output: [5,6,7,1,2,3,4] Explanation:…
You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.…
Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. k is a positive integer and is less…
Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty…