- 01Getting Started
- 02Your First Output (fmt.Println)
- 03Working with Variables
- 04Conditionals (if statements)
- 05Loops (for statements)
- 06Writing a Function
- 07Slices (Arrays)
- 08Loops (a for statement in place of while)
- 09Structs (an Object-Oriented Style)
- 10Error Handling
- 11Sorting a Slice
- 12Recursive Functions
- 13Using the Standard Library
- 14The switch Statement
- 15Anonymous Functions (Closures)
- 16Reusing Code with Struct Embedding
- 17Writing Comments
- 18Logical Operators (&&, ||, !)
- 19Constants (const)
- 20Splitting and Joining Strings (Split, Join)
- 21Writing nil-Safe Code (Checking a Pointer for nil)
- 22Searching a Slice
- 23Transforming a Slice (a map-like Operation)
- 24Two-Dimensional Slices (Tabular Data)
- 25Writing a Custom Error Type
- 26Variadic Parameters (...)
- 27Representing a Set with a Map (Duplicate-Free Data)
- 28Testing with Your Own assert Function
- 29Higher-Order Functions (Passing a Function as an Argument)
- 30Stacks and Queues (Basic Data Structures)
- 31Type Conversion (Casting) Basics
- 32Intro to Regular Expressions (Pattern Matching)
- 33The Binary Search Algorithm
- 34Building a Caesar Cipher (a Character-Shifting Cipher)
- 35Understanding How Bubble Sort Works
- 36Building and Displaying Dates (Basic Year/Month/Day Operations)
- 37Writing Multiple Test Cases Together
- 38Speeding Up Calculations with Memoization (Caching)
- 39Normalizing Strings (TrimSpace, Unifying Case)
- 40Shallow Copy vs. Deep Copy
- 41Enum Basics (iota)
- 42Flattening a Slice
- 43Reversing a String and Checking for Palindromes
- 44Pairing Up Two Slices (the zip operation)
- 45Rounding Numbers (Floor, Ceil, Round)
- 46Multi-Line Strings (Backquotes)
- 47Functions That Return Multiple Values
- 48Finding the GCD and LCM (the Euclidean Algorithm)
- 49Formatting Numbers (Padding Digits, Decimal Places)
- 50Cleanup Logic with defer
- 51Writing Generic Functions
- 52File Reading and Writing Basics
- 53Generating Random Numbers
- 54Bitwise Operators (AND, OR, XOR, shifts)
- 55Reading Command-Line Arguments
- 56Waiting for a Fixed Amount of Time (time.Sleep)
- 57Watch Out for Floating-Point Rounding Errors
- 58Reading from Standard Input
- 59FizzBuzz (the Classic Practice Problem)
- 60Checking Whether a Number Is Prime
- 61Set Operations with Maps (Union, Intersection, Difference)
- 62Converting Number Bases (Binary, Hex)
- 63Checking Balanced Parentheses (an Application of Stacks)
- 64Checking Whether Two Words Are Anagrams
- 65Checking Whether a Year Is a Leap Year
- 66Converting Temperature (Celsius to Fahrenheit)
- 67Prime Factorization
- 68[Applied] Build a Simple Inventory Management Tool
Transforming a Slice (a map-like Operation)
In this lesson you will learn how to transform every element of a slice in Go so you can process data in bulk. This is for anyone searching for "Go slice map transform".
Go has no standard map() function like some languages, but building a new slice in a for loop does the same job. Think of it as a machine on a conveyor belt that processes every product that passes through it in the same way.
The sample code has mapInts() take a function f func(int) int as an argument, walk the original slice with for i, n := range nums, and store each converted value with result[i] = f(n). Passing the function in makes it a general-purpose helper whose transformation rule can simply be swapped out.
A common stumbling block for beginners is having to size the result slice in advance with make([]int, len(nums)). You could build it with append alone, but reserving the length with make is more efficient when the size is known.
In real-world development this shape comes up whenever you process data in bulk, such as applying tax to prices or converting units.
๐งช This site can't compile or run Go directly, so it checks on the spot whether what you typed matches the reference code (scoring happens entirely in your browser โ nothing is sent anywhere).
