find the smallest key in a map in go

To find the smallest key in a map in Go, you can loop through the keys and keep track of the minimum key found so far using the built-in math package. Here's an example code snippet:


main.go
import "math"

func findSmallestKey(m map[string]int) string {
    // initialize the minimum key to the largest possible value
    minKey := ""
    minValue := math.MaxInt32

    // loop through the keys of the map
    for key, value := range m {
        // if the current key is smaller than the minimum key found so far, update the minimum key
        if key < minKey {
            minKey = key
            minValue = value
        }
    }
    
    // return the smallest key found
    return minKey
}
504 chars
20 lines

You can then call this function with your map to get the smallest key:


main.go
m := map[string]int{"c": 3, "a": 1, "b": 2}
minKey := findSmallestKey(m)
fmt.Println(minKey) // prints "a"
107 chars
4 lines

similar go code snippets

find the smallest key in a map in go

check if a key exists in a map with a key of type int in go

find the key associated with a value in a map in go

add a key and value to a map with a key of type int in go

find the value associated with a key in a map in go

check if a key exists in a map in go

check if a key does not exist in a map in go

add a key and value to a map in go

find the largest key in a map in go

find the keys of a map in go

related categories