Algorithmic section: two problems of LeetCode Medium level and above. Duration — 1.5 hours for two problems.

To solve LeetCode Medium and higher level problems in Go, it is important to effectively use data structures and algorithms such as:

• Trees and graphs (DFS, BFS)
• Dynamic programming
• Hash tables
• Double-ended queues and stacks

Example solution for the "Two Sum" problem:

func twoSum(nums []int, target int) []int {
    m := make(map[int]int)
    for i, num := range nums {
        if j, ok := m[target - num]; ok {
            return []int{j, i}
        }
        m[num] = i
    }
    return nil
}

To successfully complete two tasks in 1.5 hours, it is recommended to carefully read the problem statement first, think through the optimal algorithm, and then implement and test the code.