What are goroutines?
Junior
404
Golang
8386
379
What is a race condition and how to deal with it in Go?
Middle
339
Can you explain what is meant by the term 'context' in programming or development?
Junior — Middle
330
What is the role and purpose of context in the Go programming language?
Junior — Middle
293
What is the difference between buffered and unbuffered channels?
Junior — Middle
276
How can you manage goroutines and do they all run in a single thread?
Middle
271
What team did you have, how many people?
Senior
269
What are the differences in application and features of the Go programming language compared to Python?
Junior — Middle
258
What does the load average column in the top utility mean?
Middle
258
Tell us about Big O asymptotic notation: what it is, what types exist, and what they are used for.
Middle
247
Why is TCP needed if IP packets can be retransmitted when no response is received?
Middle
245
What methods and approaches do you use to verify the functionality of your code?
Junior — Middle
233
What can you tell about your experience integrating various systems or services?
Junior — Middle
229
Why are caches and caching necessary? What is a negative cache?
Middle
225
How to analyze the state of a Linux machine without monitoring if it 'feels bad'? How to identify the causes of problems?
Middle+
225
How can embedded structures be used to simulate inheritance in Go?
Middle
223
What is the GMP scheduler model in Go?
Middle
221
import "fmt" func maxDistants(arr []int) int { maxDist := 0 lastOne := -1 for i := 0; i < len(arr); i++ { if arr[i] == 1 { if lastOne == -1 { maxDist = i } else { dist := (i - lastOne) / 2 if dist > maxDist { maxDist = dist } } lastOne = i } } if arr[len(arr)-1] == 0 { dist := len(arr) - 1 - lastOne if dist > maxDist { maxDist = dist } } return maxDist } func main() { fmt.Println(maxDistants([]int{1, 0, 0, 0, 1})) }
Middle
218
What happens if you try to read data from a channel that currently contains no elements?
216
Binary search and search tree traversal have the same logarithmic complexity. Why do we need multiple algorithms with the same algorithmic complexity? Should we always use a tree instead of binary search?
Middle
214