How is the interface in Go structured internally (in memory)?
Golang
How to guarantee data consistency — that the message will be stored in the database and delivered to the recipient?
Do you have any questions for us?
What is the HTTP protocol? What are the parts of an HTTP request? What are headers and cookies?
Were there any issues with splitting the unified database?
What is the difference between TCP and UDP? Why is TCP used for HTTPS?
What happens in the network when you enter https://wildberries.ru in the browser? Describe the DNS resolution process.
What do we need to do for you to see a high engineering culture?
Tell us about your recent activities, interesting or uninteresting things you've done lately.
What is the GOMAXPROCS variable in Go? Can a program use more threads than specified in GOMAXPROCS?
Condition We have a database of user passwords, which are hashed (using the hashPassword function), and we also know the set of characters that can be used in passwords (the variable alphabet). Our task is to implement the RecoverPassword function so that it recovers the password from the known hash and TestRecoverPassword completes successfully. Basic requirements: Solve as you wish package main import ( "crypto/md5" "fmt" ) var alphabet = []rune{'a', 'b', 'c', 'd', '1', '2', '3'} func RecoverPassword(h []byte) string { return "" } func hashPassword(in string) []byte { h := md5.Sum([]byte(in)) return h[:] } func main() { tests := []string{"a", "12", "abc333d"} ok := true for _, exp := range tests { h := hashPassword(exp) act := RecoverPassword(h) if act != exp { fmt.Printf("Error: expected %q, got %q\n", exp, act) ok = false } } if ok { fmt.Println("All tests passed successfully") } }
Suggest optimal indexes for a query filtering by location and gender fields for maximum performance.
Difficulty: EASY Given a sorted array of numbers with duplicates, remove duplicates in-place and return the size of the resulting array. Example: Input: nums = [0,0,1,1,1,2,2,3,3,4] Output: 5, nums = [0,1,2,3,4,_,_,_,_,_] Explanation: The array has 5 unique elements. Place them at the first five positions and return 5. Remaining elements can be any.
Why is a message broker (Kafka) needed? How does it fit into the architecture?
Как устроено наследование контекстов в Go (context.WithValue, context.Background)?
How to guarantee message order in a chat?
What is a JWT token? What is its structure and advantages over regular tokens?
Regarding brokers — how did you use Kafka and RabbitMQ? Why two?
What synchronization primitives are available for goroutines in Go? Fix the race condition example using atomic.
What primitives of synchronization do you know in OS?