Go Assignment - 3

Welcome to the third assignment of this Go Tutorial series.

Objectives of the assignment:

  1. To revise the concepts studied till now.

  2. To have a clear understanding of the theory.

  3. Writing a working Go code.

Coding Paradigms:

  1. Use proper comments while writing your code.

  2. Use sensible variable names.

  3. Try to use the concepts studied wherever applicable.

  4. Try to take inputs from the system and not hardcode it.

  5. Always check for corner cases. Your code should run properly for any input.

How do you evaluate your assignment?

  1. Your code should compile without any error.

  2. Test your code for the test case provided in the problems.

If you want a detailed analysis of your solution(code review included), please mail your solution to aman.st.francis@gmail.com with the following details:

  1. Subject: Go Assignment -3 Solution

  2. Body: Write your name and your place of residence.

  3. Attachment: Please make sure that you send a single attachment in a zip folder titled Go_Assignment_3.zip. Place all the solutions in the folder.


  1. Write a program to implement Levenshtein Distance. Levenshtein distance (LD) is a measure of the similarity between two strings, which we will refer to as the source string (s) and the target string (t). The distance is the number of deletions, insertions, or substitutions required to transform s into t. For example, the Levenshtein distance between "Asheville" and "Arizona" is 8.

  2. Write a program to implement a Binary Search Tree. The program should support insertion operation and should implement a way of traversing the tree. A binary search tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. The value at the left node is always smaller or equal to the parent while the value on the right node is always greater than the parent.

Please Note: Do not be disheartened if you are not able to solve any problem. We are all here to learn. Send me the best you can do, just do not cheat yourself. If you send me your best work, I could analyse that and come up with its feedback that will help you in the future. If you have any doubts regarding any question, write a mail to me with the subject: Clarification on Assignment-3 and write the problem you have in the mail body.

Looking forward to your solution.



©2020 by Aman Sinha.