Lectures

In this article you will learn why knowledge and skills are not the same thing, how theory differs from practice, and why it is important not only to know, but also to be able to do something useful. Real-life examples, tough questions, and motivation for those who want to become an in-demand specialist.

In this lecture, we break down how to store a set of values of the same type in Go using arrays and slices: how [N]T differs from []T, why an array’s length is part of its type, how indexing and copying work during assignment, what happens when passing them to functions, why slices cannot be compared using ==, and what “mental model” (box vs. handle) is convenient to keep in mind to avoid unexpected effects.

In this lecture, you will learn the mental model of a slice in Go as a “handle to data”: what a slice header consists of (a pointer to data, length, and capacity), how len sets indexing boundaries, why cap exists, why assignment copies only the header (not the elements), and how simple code experiments can teach you to predict slice behavior and avoid common mistakes.

In this lecture, you will break down the difference between a nil slice and an empty slice in Go: what is the zero value for []T, how to create slices using make and literals, how len checks differ from comparisons with nil, which operations are safe on a nil slice, and which typical mistakes are most often found in real-world code.

In this lecture, you will break down the contract of the built-in function append in Go: why you must always save the result, how len and cap change when you add elements, what backing array reallocation is and why, after a “move,” two slices created via assignment can start pointing to different arrays. We will also look at how append works with a nil slice, a mini-practice task list, and common mistakes that most often catch beginners.

In this lecture, we cover a practical Go technique: how to preallocate slice capacity with make(..., 0, cap) so that append inside a loop reallocates and copies elements less often. You will see the difference between make([]T, n) and make([]T, 0, n), an example of building a task list (TaskBox), a way to “see” reallocations by tracking changes in cap, and common mistakes when working with slices.

In this lecture you will learn what Scrum is—a popular agile project management methodology in IT—how sprints, roles, and artifacts are organized, why you need a Scrum Board and a backlog, and why process standardization helps a team work more efficiently and with less stress. Everything is explained in plain language and with real-life examples from developers.