Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Go Programming Articles
Page 5 of 86
Golang Program to round up the next highest power of 2.
ExamplesFor example, n = 12 => Next number power of 2 is 16.For example, n = 20 => Next number power of 2 is 32.Approach to solve this problemStep 1 − Define method, that accepts a number n.Step 2 − Iterate k := 1 until k < n.Step 3 − In a loop, calculate k
Read MoreGolang Program to round up the next previous power of 2.
ExamplesFor example, n = 12 => Previous number power of 2 is 8.For example, n = 20 => Previous number power of 2 is 16.Approach to solve this problemStep 1 − Define a method that accepts a number n.Step 2 − Perform n | (n >> k), where k is 1, 2, 4, 8, 16.Step 3 − At the end, return n - (n >> 1).Examplepackage main import "fmt" func PreviousPowOf2(n int) int{ n = n | (n >> 1) n = n | (n >> 2) n = n | (n >> 4) n = ...
Read MoreGolang Program to check the power of 4 of a given number
ExamplesFor example, n = 12 => 12 is not the power of 4.For example, n = 64 => 64 is the power of 4.Approach to solve this problemStep 1 − Define a method that accepts a number n.Step 2 − Divide log(n) by log(4), store in res.Step 3 − If the floor of res is same as the res, then print that n is the power of 4.Step 4 − Else, print that n is not the power of 4.Examplepackage main import ( "fmt" "math" ) func CheckPowerOf4(n int){ res := math.Log(float64(n)) / math.Log(float64(4)) if res ...
Read MoreGolang Program to find the odd-occurring elements in a given array
ExamplesFor example, arr = [1, 4, 5, 1, 4, 5, 1] => Odd-occurring element in the array is: 1Approach to solve this problemStep 1 − Define method that accepts an array.Step 2 − Declare a xor variable, i.e., xor := 0.Step 3 − Iterate input array and perform xor operation with each element of the array.Step 4 − At the end, return xor.Examplepackage main import ( "fmt" ) func FindOddOccurringElement(arr []int) int{ xor := 0 for i := 0; i < len(arr); i++ { xor = xor ^ arr[i] } return xor ...
Read MoreGolang Program to traverse a given binary tree in Preorder Traversal (Recursive)
ExampleSuppose we have the following binary tree.Preorder Tree Traversal Output: 1, 2, 4, 5, 3, 6, 7.Approach to solve this problemStep 1 − If the root node of the given tree is nil, then return; else, follow the steps given below.Step 2 − Print the root node data.Step 3 − Traverse the Left sub-tree.Step 4 − Traverse the Right sub-tree.Examplepackage main import "fmt" type Node struct { data int left *Node right *Node } func (root *Node)PreOrderTraversal(){ if root !=nil{ fmt.Printf("%d ", root.data) root.left.PreOrderTraversal() root.right.PreOrderTraversal() } ...
Read MoreGolang Program to convert an integer into binary representation
ExamplesFor example, n = 1 (Binary Representation of 1: 1)For example, n = 5 (Binary Representation of 5: 101)For example, n = 20 (Binary Representation of 5: 10100)For example, n = 31 (Binary Representation of 31: 11111)Approach to solve this problemStep 1 − Define a method that accepts an integer, n.Step 2 − Convert n into binary representation using golang packageStep 3 − Return the converted binary representation.Examplepackage main import ( "fmt" "strconv" ) func IntegerToBinary(n int) string { return strconv.FormatInt(int64(n), 2) } func main(){ n := 1 fmt.Printf("Binary Representation of %d is %s.", n, ...
Read MoreGolang Program to define a singly linked list.
ExamplesApproach to solve this problemStep 1 − Let’s define a structure of the node.Step 2 − Make the Linked List such that the previous node would store the address of the next node.Examplepackage main import "fmt" type Node struct { value int next *Node } func NewNode(value int) *Node{ var n Node n.value = value n.next = nil return &n } func TraverseLinkedList(head *Node){ fmt.Printf("Linked List: ") temp := head for temp != nil { fmt.Printf("%d ", temp.value) temp = temp.next } } func main(){ head := NewNode(30) head.next = NewNode(10) head.next.next = NewNode(40) head.next.next.next = NewNode(40) TraverseLinkedList(head) }OutputLinked List: 30 10 40 40
Read MoreGolang Program to count the number of nodes in a linked list.
ExamplesApproach to solve this problemStep 1 − Define a method that accepts the head of the linked list.Step 2 − Initialize a variable, count := 0.Step 3 − Iterate the given linked list till it reaches the last node.Step 4 − Increase the count by 1 in the loop.Step 5 − Return count.Examplepackage main import "fmt" type Node struct { value int next *Node } func NewNode(value int, next *Node) *Node{ var n Node n.value = value n.next = next return &n } func CountNodes(head *Node){ fmt.Printf("Input Linked List is: ") count ...
Read MoreGolang Program to reverse a given linked list.
ExamplesApproach to solve this problemStep 1 − Define a method that accepts the head of a linked list.Step 2 − If head == nil, return; else, call ReverseLinkedList, recursively.Step 3 − Print head.value at the end.Examplepackage main import "fmt" type Node struct { value int next *Node } func NewNode(value int, next *Node) *Node{ var n Node n.value = value n.next = next return &n } func TraverseLinkedList(head *Node){ fmt.Printf("Input Linked List is: ") temp := head for temp != nil { fmt.Printf("%d ", temp.value) ...
Read MoreGolang Program to delete the first node from a linked list.
ExampleApproach to solve this problemStep 1 − Define a method that accepts the head of a linked list.Step 2 − If head == nil, return the head.Step 3 − Go to the next node and return the updated head.Examplepackage main import "fmt" type Node struct { value int next *Node } func NewNode(value int, next *Node) *Node{ var n Node n.value = value n.next = next return &n } func TraverseLinkedList(head *Node){ temp := head for temp != nil { fmt.Printf("%d ", temp.value) temp = temp.next ...
Read More