Study notes, some algorithm problems and golang solutions done recently.
Recursion is a technique used to solve computer problems by creating a function that calls itself until your program achieves the desired result.
A stack is a memory in which values are stored and retrieved in “last in first out” manner. Data is added to stack using push operation and data is taken out of stack using pop operation.
This post is an about an array-related question that often comes up in interviews, and the solution. Before that, we learned the basic data structures of the Go programming language. It is a good way to further relate to what we have learned earlier.
This is an introductory article to the Go programming language, briefly introducing basic data types and data structures.