Why slices are used in Go

Introduction

Slices let you work with lists of items easily and efficiently. They help you handle groups of data without fixing the size in advance.

When you need a list that can grow or shrink during the program.

When you want to pass a part of an array without copying all data.

When you want to share data between functions without extra memory use.

When you want to work with dynamic collections like user inputs or file lines.

Syntax

Go

var s []int
s = []int{1, 2, 3}
s = append(s, 4)

Slices are like windows to arrays; they do not store data themselves but point to arrays.

You can add items to slices using append, which creates a bigger underlying array if needed.

Examples

Create a slice with three numbers.

Go

var numbers []int
numbers = []int{10, 20, 30}

Add a new number to the slice.

Go

numbers = append(numbers, 40)

Create a slice that views part of the original slice.

Go

part := numbers[1:3]

Sample Program

This program shows how to create a slice, add an item, and print all items. It demonstrates slices' flexibility to grow.

Go

package main
import "fmt"

func main() {
    // Create a slice of strings
    fruits := []string{"apple", "banana", "cherry"}

    // Add a new fruit
    fruits = append(fruits, "date")

    // Print all fruits
    for i, fruit := range fruits {
        fmt.Printf("Fruit %d: %s\n", i+1, fruit)
    }
}

Important Notes

Slices are more flexible than arrays because their size can change.

When you pass a slice to a function, it shares the same underlying array, so changes affect the original data.

Summary

Slices let you work with lists that can change size.

They point to arrays but are easier to use and more flexible.

Use slices to handle dynamic data efficiently.

Practice

1.

Why are slices preferred over arrays in Go?

easy

A. Because arrays cannot store multiple values

B. Because slices use less memory than arrays

C. Because slices can change size dynamically while arrays have fixed size

D. Because slices are slower but more secure

Solution

1. Step 1: Understand array size behavior

   Arrays in Go have a fixed size defined at creation and cannot grow or shrink.

2. Step 2: Understand slice flexibility

   Slices are built on arrays but can dynamically change size, making them more flexible for varying data.

3. Final Answer:

   Because slices can change size dynamically while arrays have fixed size -> Option C

4. Quick Check:

   Slice size flexibility = A [OK]

Hint: Remember: slices grow, arrays don't [OK]

Common Mistakes:

• Thinking arrays can resize dynamically
• Confusing memory usage between slices and arrays
• Believing slices are slower than arrays

2.

Which of the following is the correct way to declare a slice of integers in Go?

var s _____

easy

A. []int

B. [5]int

C. int[]

D. slice int

Solution

1. Step 1: Recall slice syntax

   In Go, slices are declared with square brackets and no size: []type.

2. Step 2: Identify correct option

   []int uses []int which is the correct syntax for a slice of integers.

3. Final Answer:

   []int -> Option A

4. Quick Check:

   Slice declaration = []int [OK]

Hint: Slices use []type without size [OK]

Common Mistakes:

• Using fixed size like [5]int for slices
• Writing type after brackets like int[]
• Using invalid keywords like 'slice int'

3.

What will be the output of this Go code?

arr := [3]int{1, 2, 3}
slice := arr[:2]
slice = append(slice, 4)
fmt.Println(arr)

medium

A. [1 2 4]

B. [1 2 3 4]

C. [1 2 3]

D. Runtime error

Solution

1. Step 1: Understand slice and array relation

   The slice references the first two elements of arr: [1, 2], with length 2 and capacity 3.

2. Step 2: Append behavior on slice

   Appending 4 to slice: since current length 2 < capacity 3, it appends in place to the underlying array, setting arr[2] = 4. Thus, arr becomes [1 2 4].

3. Final Answer:

   [1 2 4] -> Option A

4. Quick Check:

   Append within capacity modifies underlying array = B [OK]

Hint: Append within capacity modifies shared array [OK]

Common Mistakes:

• Thinking append always reallocates a new array
• Expecting arr to grow to 4 elements
• Thinking append causes runtime error

4.

Identify the error in this Go code snippet:

var s []int
s[0] = 10
fmt.Println(s)

medium

A. Syntax error: slice declaration is incorrect

B. Slice s is nil and has no elements, so s[0] assignment causes runtime panic

C. No error, code prints [10]

D. Compile error: cannot assign to slice element

Solution

1. Step 1: Check slice initialization

   Variable s is declared but not initialized; it is nil with length 0.

2. Step 2: Understand assignment to s[0]

   Assigning to s[0] causes runtime panic because no elements exist yet.

3. Final Answer:

   Slice s is nil and has no elements, so s[0] assignment causes runtime panic -> Option B

4. Quick Check:

   Assigning to nil slice index = runtime panic [OK]

Hint: Initialize slice before assigning elements [OK]

Common Mistakes:

• Assuming slice auto-expands on index assignment
• Thinking code compiles with no error
• Confusing compile error with runtime panic

5.

You want to collect an unknown number of user scores efficiently. Which approach best uses slices?

1. Use a fixed-size array
2. Use a slice and append scores as they come
3. Use a map with indexes
4. Use a string to store scores

hard

A. Use a fixed-size array

B. Use a string to store scores

C. Use a map with indexes

D. Use a slice and append scores as they come

Solution

1. Step 1: Consider data size flexibility

   User scores count is unknown, so fixed-size array is not suitable.

2. Step 2: Evaluate slice usage

   Slices can grow dynamically and efficiently handle unknown data sizes by appending.

3. Step 3: Exclude other options

   Maps add overhead and strings are not suitable for numeric data storage.

4. Final Answer:

   Use a slice and append scores as they come -> Option D

5. Quick Check:

   Dynamic data collection = slice append [OK]

Hint: Use slices to grow lists dynamically [OK]

Common Mistakes:

• Choosing fixed arrays for unknown sizes
• Using strings for numeric data
• Overcomplicating with maps when slices suffice