[LeetCode] 724. Find Pivot Index(Java)
Find Pivot Index - LeetCode Can you solve this real interview question? Find Pivot Index - Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of leetcode.com 📚 문제 Given an array of integers nums, calculate the pivot index of this array. The pivot index is the..
[LeetCode] 704. Binary Search(Java)
Binary Search - LeetCode Can you solve this real interview question? Binary Search - Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. leetcode.com 📚 문제 Given an array of integers nums which is sorted in ascending order, and an integer target, write a..
[LeetCode] 1480. Running Sum of 1d Array(Java)
Running Sum of 1d Array - LeetCode Can you solve this real interview question? Running Sum of 1d Array - 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 = [1,2,3,4] Output: [1,3,6, leetcode.com 📚 문제 Given an array nums. We define a running sum of an array as runningSum[i] = sum(num[0]...nums[..