Go Programming Articles

Page 10 of 86

Write a Golang program to find pairs with the given sum in an array(O(n))

Kiran P
Kiran P
Updated on 11-Mar-2026 804 Views

ExamplesInput Array = [1, 3, 5, 7, 8, 9], sum = 11 => (3, 8)Approach to solve this problemStep 1: Define a method that accepts an array and sum.Step 2: Define a mapping variable, type map[int]int.Step 3: Iterate the given array as i.Step 4: If key in mapping sum-arr[i] is not present, then mapping[arr[i]]=i.Step 5: If present, then print “pair is found”.Step 6: At the end, print that “pair not found”.Programpackage main import "fmt" func findSumPair(arr []int, sum int){    mapping := make(map[int]int)    for i:=0; i

Read More

Write a Golang program to sort a binary array in linear time

Kiran P
Kiran P
Updated on 11-Mar-2026 408 Views

There are two methods in which we can solve this problem. Let’s check the first method.Method 1ExamplesInput Array = [1, 0, 1, 0, 1, 0, 0, 1] => [0, 0, 0, 0, 1, 1, 1, 1]Approach to solve this problemStep 1: Define a method that accepts an array.Step 2: Count number of 0.Step 3: Store 0 till count becomes 0 and store 1 at the remaining indexes.Step 4: At the end, return the array.Programpackage main import "fmt" func binarySort(arr []int) []int{    count := 0    for i:=0; i

Read More

Write a Golang program to find duplicate elements in a given array

Kiran P
Kiran P
Updated on 11-Mar-2026 6K+ Views

ExamplesInput Array = [1, 3, 5, 6, 1] => Duplicate element is 1;Input Array = [1, 3, 5, 6, 7] => return -1Approach to solve this problemStep 1: Define a method that accepts an array.Step 2: Declare a visited map.Step 3: Iterate the given array. If the element exists in the visited map, then return that element.Step 4: Else, return -1.Programpackage main import "fmt" func duplicateInArray(arr []int) int{    visited := make(map[int]bool, 0)    for i:=0; i

Read More

Write a Golang program to find duplicate elements in a given range

Kiran P
Kiran P
Updated on 11-Mar-2026 704 Views

We can solve this problem in two different ways. Let’s check the first method.Method 1: ExamplesInput Array = [1, 2, 3, 4, 4] => Range is from 1 to 5 but 4 is a duplicate element in this range.Approach to solve this problemStep 1: Define a method that accepts an array.Step 2: Declare a visited map.Step 3: Iterate the given array. If the element exists in the visited map, then return that element.Step 4: Else, return -1.Programpackage main import "fmt" func duplicateInArray(arr []int) int{    visited := make(map[int]bool, 0)    for i:=0; i Range is from 1 to 5 but 4 is ...

Read More

Write a Golang program to find odd and even numbers using bit operation

Kiran P
Kiran P
Updated on 11-Mar-2026 590 Views

ExamplesInput num = 5 => 101 & 1 = 001 => True, i.e., Odd; else num would be Even.Approach to solve this problemStep 1: Define a method that accepts a number.Step 2: Perform & operation with that number.Step 3: If the & operator returns a non-zero value, then that number would be odd.Step 4: Else, the number would be even.Programpackage main import "fmt" func oddEven(num int){    if num & 1 != 0 {       fmt.Println("ODD")    } else {       fmt.Println("EVEN")    } } func main(){    oddEven(13)    oddEven(50)    oddEven(0) }OutputODD EVEN EVEN

Read More

Nth Catalan Number in Go Lang

Dev Prakash Sharma
Dev Prakash Sharma
Updated on 11-Mar-2026 298 Views

Catalan Numbers are sequences of natural numbers that gives the number of BST (Binary Search Tree) possible with n Values. So, the Catalan number is a full binary tree with n+1 leaves.Some applications of Catalan Numbers are counting the pairs of nested parentheses, valid mountain ranges etc.For n = 5, C = (C(0) * C(4)) + (C(1) * C(3)) + (C(2) * C(2)) + (C(3) * C(1)) + (C(4)* C(0))Thus, we can see that Catalan numbers are in the form of a recursive relation, i.e., for the nth term, the Catalan number Cn is,             ...

Read More

Selection Sort in Go Lang

Dev Prakash Sharma
Dev Prakash Sharma
Updated on 11-Mar-2026 2K+ Views

Selection sort is a sorting algorithm that is used to sort the elements by repeatedly finding the minimum element and placing it at the first in the unsorted part of the array. After placing the minimum element in one end of the array, the array is then divided into two subparts which can be again sorted using the algorithm.For ExampleInputarr[ ] = {2, 9, 4, 3, 5, 1}Output1 2 3 4 5 9ExplanationAfter sorting the given array, it becomes 1, 2, 3, 4, 5, 9Algorithm:Take an array of integers as the input.Find the index of the minimum element by iterating ...

Read More

Difference between Go and Java.

Ashin Vincent
Ashin Vincent
Updated on 17-Apr-2025 547 Views

Both Go and Java are popular backend programming languages, and each has its own unique features. Java is an older language with a large community support, whereas Go is a comparatively newer language developed by Google. In this article, we will learn more about the differences between Go and Java. Go Language Go, also called Golang, is an open-source programming language developed by Robert Griesemer, Rob Pike, and Ken Thompson at Google. It was created to build large and complex software systems more easily. It is a statically typed and compiled programming language that has a simple and ...

Read More

How to check if a file exists in Golang?

Mukul Latiyan
Mukul Latiyan
Updated on 01-Nov-2023 43K+ Views

In order to check if a particular file exists inside a given directory in Golang, we can use the Stat() and the isNotExists() function that the os package of Go's standard library provides us with.The Stat() function is used to return the file info structure describing the file. Let's first use the Stat() function only and see whether it will be enough to detect the presence of a file in Go.Example 1Consider the code shown below.package main import(    "fmt"    "os" ) func main() {    if _, err := os.Stat("sample.txt"); err == nil {       fmt.Printf("File ...

Read More

math.Float64bits() Function in Golang With Examples

Pranavnath
Pranavnath
Updated on 23-Oct-2023 471 Views

Introduction In the world of programming, effectiveness, and accuracy are vital. One dialect that grasps these standards is Go, too known as Golang. One significant angle of programming is working with numbers, and when it comes to floating-point numbers, precision things. This can be where the math.Float64bits() function in Golang sparkles. In this article, we are going to delve into the complexities of math.Float64bits() work, look at its noteworthiness and challenges in different applications, and eventually get its part within the broader setting of Golang programming. Overview of Float64 in Golang The float64 type in Golang uses the IEEE 754 standard representation to ...

Read More
Showing 91–100 of 852 articles
« Prev 1 8 9 10 11 12 86 Next »
Advertisements