Problem Statement You are the technical director of WSPT radio, serving listeners nationwide. For simplicity’s sake we can consider each listener to live along a horizontal line stretching from 0 (west) to 1000 (east). Given a list of N listeners, and a list of M radio towers, each placed at…

This is part 4of the series — working with Binary Trees in Go. In this article, I will show how to perform zigzag level order traversal of a binary tree in Go. Part 1 Binary Tree Traversals in Go (access it here) Part 2 Binary Tree Traversals in Go —…

This is part 3 of the series — working with Binary Trees in Go. In this article, I will show how to perform level order traversal of a binary tree in Go. Part 1 Binary Tree Traversals in Go (access it here) Part 2 Binary Tree Traversals in Go —…

This is part 2 of the series — working with Binary Trees in Go. I would like to show iterative implementation of the three traversal algorithms discussed in part 1 of the series. Part 1 Binary Tree Traversals in Go (access it here) Part 2 Binary Tree Traversals in Go…

When I first began my journey with Go I wanted to pick several simple and intuitive problems and code their solutions in Go. …

Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example, [3,6,2,7] is a subsequence of the array [0,3,1,6,2,2,7] …

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. (This is Leetcode problem # 347) Example: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Explanation: 1 occurs three times and 2 occurs two times in…