Gopythor

Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -1. After doing so, return the array. Example 1: Input: arr = [17,18,5,4,6,1] Output: [18,6,6,6,1,-1] Explanation: - index 0 --> the greatest element to the right of index 0 is index 1 (18). - index 1 --> the greatest element to the right of index 1..

Go/Leet Code 2022. 3. 5. 20:43

What are in-place array operations? Given an Array of integers, return an Array where every element at an even-indexed position is squared. Input: array = [9, -2, -9, 11, 56, -12, -3] Output: [81, -2, 81, 11, 3136, -12, 9] Explanation: The numbers at even indexes (0, 2, 4, 6) have been squared, whereas the numbers at odd indexes (1, 3, 5) have been left the same. Not in-place Code Java public in..

Go/Leet Code 2022. 3. 5. 18:52

Durations Number of nanoseconds between two times instances Go's way to identify time durations Examples: 3*time.Second => time duration of 3 seconds 3*time.Minute => time duration of 3 minutes So what are the relations. The Duration is a special type in go that can describe a time duration based on the number of nanoseconds. Between the start and the end time the type exists in the time package..

Go/Mastering Go 2022. 3. 5. 18:17

Given an array of integers arr, return true if and only if it is a valid mountain array. Recall that arr is a mountain array if and only if: arr.length >= 3 There exists some i with 0 arr[i + 1] > ... > arr[arr.length - 1] Constraints: 1 arr[i] { goingUp = false down++ } else { up++ } } else { if arr[i-1] < arr[..

Go/Leet Code 2022. 3. 4. 02:03

Given an array arr of integers, check if there exists two integers N and M such that N is the double of M ( i.e. N = 2 * M). More formally check if there exists two indices i and j such that : i != j 0

Go/Leet Code 2022. 3. 2. 23:25

Search in an Array Linear Search The time complexity for a linear search is O(N)O(N) Edge case refers to a problem that occurs when the value of data processed by the algorithm exceeds a certain range according to the characteristics of the algorithm. For example, a problem may occur when the value of the variable called fixnum exceeds the range of -128 to 127. https://kathak33.tistory.com/19 Le..

Go/Leet Code 2022. 3. 2. 19:19

So even though Go prefers channels and go routines for concurrent tasks. There are cases where locking memory is inevitable. So in go to access any functionality related to thread Locking we need to use the sync package which is a standard package in go as shown here. So there are numerous features enabled by sync. However for us we will focus on the most useful and commonly used features can ge..

Go/Mastering Go 2022. 3. 2. 01:51

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements aft..

Go/Leet Code 2022. 3. 1. 18:03