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
-
Economics & Finance
Server Side Programming Articles
Page 1119 of 2109
Golang Program to insert a new node after the Kth node.
ExamplesAdd node 15 after 10 value node.Approach 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 − Iterate the given linked list.Step 4 − If temp.value is 10, then add the node 15 as the next node.Step 5 − If node value 10 is not found, return the head without adding any node.Examplepackage main import "fmt" type Node struct { value int next *Node } func NewNode(value int, next *Node) *Node{ var n Node n.value = value ...
Read MoreGolang program to delete the node after the Kth node.
ExamplesDelete node after 10 value node.Approach 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 − Iterate the given linked list.Step 4 − If temp.value is 10, then override that node’s next value with its next node’s next value.Step 5 − If node value 10 is not found, return the head without deleting any node.Examplepackage main import "fmt" type Node struct { value int next *Node } func NewNode(value int, next *Node) *Node{ var n Node n.value = ...
Read MoreGolang Program to update the node value after the Kth node.
ExamplesUpdate node after k=10 value nodeApproach 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 − Iterate the given linked list.Step 4 − If temp.value is 10, then update temp.next.value=data.Step 5 − If node value 10 is not found, return the head without updating any node.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 } ...
Read MoreGolang Program to update the node value after the Kth node (When K is not in the linked list).
ExamplesUpdate node after k=50 value nodeApproach 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 − Iterate the given linked list.Step 4 − If node value 10 is not found, return the head without updating any node.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 ...
Read MoreGolang Program to update the ith index node value, when index is at 0 index.
ExamplesApproach 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 − Initialize the index as i := 0.Step 4 − Iterate the given linked list from its head.Step 5 − If index i matches with given index (to be updated), then update that node.Step 6 − Else, return the 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 ...
Read MoreGolang Program to update the ith index node value, when index is at the last index.
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 − Initialize the index as i := 0.Step 4 − Iterate the given linked list from its head.Step 5 − If index i matches with the given index (to be updated), then update that node.Step 6 − Else, return 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 ...
Read MoreHow to find the row-wise mode of a matrix in R?
There is no in-built function to find the mode in R, hence we need to create one and then apply it to the rows of the matrix. The function for mode is created as follows −mode M1 M1Output [,1] [,2] [,3] [,4] [,5] [1,] 2 2 1 2 2 [2,] 2 2 2 2 1 [3,] 2 2 1 1 1 [4,] 2 1 1 1 1 [5,] 2 1 1 2 2> apply(M1,1,mode)Output[1] 2 2 1 1 2Example2> M2 M2Output [,1] [,2] [,3] [,4] [,5] [1,] 1 1 2 2 1 [2,] 2 1 1 2 1 [3,] 2 2 1 1 1 [4,] 2 1 1 2 2 [5,] 2 1 1 2 2 [6,] 1 2 1 1 2 [7,] 1 1 2 1 2 [8,] 2 2 1 2 1 [9,] 2 1 1 2 2 [10,] 1 1 2 2 2 [11,] 1 1 2 1 2 [12,] 1 2 2 2 1 [13,] 2 2 2 2 1 [14,] 2 1 2 2 1 [15,] 1 2 1 1 2 [16,] 2 2 1 2 1 [17,] 2 2 1 1 1 [18,] 2 1 1 2 1 [19,] 1 1 1 2 1 [20,] 2 1 1 2 2> apply(M2,1,mode)Output[1] 1 1 1 2 2 1 1 2 2 2 1 2 2 2 1 2 1 1 1 2Example3> M3 M3Output [,1] [,2] [,3] [,4] [,5] [1,] 1 3 3 2 1 [2,] 2 3 1 2 2 [3,] 2 2 3 3 1 [4,] 1 3 1 3 2 [5,] 3 1 2 1 2 [6,] 2 3 1 1 1 [7,] 2 2 2 3 1 [8,] 1 2 2 2 2 [9,] 2 1 2 1 2 [10,] 1 3 1 2 1 [11,] 2 1 3 1 1 [12,] 1 1 3 2 2 [13,] 2 1 1 1 2 [14,] 2 1 3 3 2 [15,] 1 2 3 1 2 [16,] 1 2 1 2 1 [17,] 3 1 1 3 2 [18,] 3 3 3 3 1 [19,] 3 2 3 1 1 [20,] 3 3 2 2 1> apply(M3,1,mode)Output[1] 1 2 2 1 1 1 2 2 2 1 1 1 1 2 1 1 1 3 1 2Example4> M4 M4Output [,1] [,2] [,3] [,4] [,5] [1,] 10 10 9 10 9 [2,] 9 9 10 9 9 [3,] 9 9 9 10 10 [4,] 10 9 9 10 10 [5,] 10 10 9 10 9 [6,] 10 10 9 10 10 [7,] 9 9 9 10 9 [8,] 9 10 9 10 9 [9,] 9 9 9 9 9 [10,] 9 10 9 10 9 [11,] 10 10 9 9 9 [12,] 9 9 9 9 9 [13,] 10 10 10 9 10 [14,] 10 9 10 10 10 [15,] 9 10 9 10 9 [16,] 9 10 9 10 9 [17,] 9 10 10 9 10 [18,] 9 9 9 9 10 [19,] 10 9 9 10 9 [20,] 10 9 9 10 9> apply(M4,1,mode)Output[1] 10 9 9 10 10 10 9 9 9 9 9 9 10 10 9 9 10 9 9 9
Read MoreGolang Program to delete the ith index node, when the index is at 0th position in the linked list.
ExamplesApproach to solve this problemStep 1 − Define a method that accepts head of the linked list.Step 2 − If head == nil, return the head.Step 3 − When index == 0, then return head.nextStep 4 − Else, Iterate given linked list from head.Step 5 − If index i matches with given index(to be delete) then delete that node.next, break the loop.Step 6 − Return, at the end of loop.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 ...
Read MoreHow to extract the first digit from a character column in an R data frame?
If we have a character column in the data frame that contains string as well as numeric values and the first digit of the numeric values has some meaning that can help in data analysis then we can extract those first digits. For this purpose, we can use stri_extract_first function from stringi package.Example1Consider the below data frame −> x1 y1 df1 df1Output x1 y1 1 1 HT14L 2 2 HT14L 3 3 HT23L 4 4 HT14L 5 5 HT32L 6 6 HT32L 7 7 ...
Read MoreGolang program to insert a node at the ith index node, when the index is at the last position in the linked list.
ExamplesExampleApproach to solve this problempackage 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 } fmt.Println() } func InsertNodeAtIthIndex(head *Node, index, data int) *Node{ if head == nil{ head = NewNode(data, nil) return head } if index ...
Read More