Leetcode#42 Problem Statement Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section)…

Problem Statement LeetCode#189 Given an integer array nums, 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: rotate 1 steps to the right: [7,1,2,3,4,5,6] rotate 2 steps to the right: [6,7,1,2,3,4,5] rotate 3 steps to the right: [5,6,7,1,2,3,4] Example 2 Input: nums = [-1,-100,3,99],…

Find the Maximum Subarray Sum LeetCode#54 Given an array of integers, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example Input: [-2,1,-3,4,-1,2,1,-5,4]Output: 6Explanation: The subarray [4,-1,2,1] has the largest sum = 6. Approach Use Kadane’s algorithm, which runs in O(n) time. Golang Code Sample runs Why does the simple check…

Golang UTF 8 Encoding Does golang used utf-8 encoding ? Yes, Go (Golang) uses UTF-8 encoding for its strings. Here are some details about how Go handles UTF-8: Key Points Example Code-1 Here’s a simple example showing how Go handles UTF-8 encoding: Output This example shows how UTF-8 encoded bytes are printed, how Unicode runes…

LeetCode#238 Problem Statement Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time and without using the division operation. Example 1: Input: nums = [1,2,3,4] Output: [24,12,8,6] Example 2: Input:…