The slices.Sort function in Go is used for sorting slices. It was introduced in Go 1.18 as part of the new generics features, providing a more straightforward and type-safe way to sort…
Category: Tech Interviews
CA TLS mTLS Interview Questions
Basic Understanding Intermediate Knowledge Advanced Understanding Scenario-Based Questions
SSL Termination
SSL termination refers to the process of decrypting SSL/TLS encrypted traffic at a certain point within the network infrastructure, rather than at the final destination server. This concept is commonly used in…
DNS Record Types
DNS (Domain Name System) records are used to translate domain names into IP addresses and provide other important information about domains and hosts. Here’s a list of common DNS record types along…
Check data type in golang
In Go (Golang), checking the data type of a variable can be done in several ways, depending on the context and what information you need about the data type. Here are some…
Decode JSON in Golang
In Go (Golang), there are several ways to decode JSON, each suited for different scenarios. Here’s a list of common methods along with their typical use cases: 1. json.Unmarshal json.Unmarshal: This is…
Find the first and last occurrence in an array
To find the first occurrence of a target value in a sorted array using binary search, the algorithm needs to be slightly modified from the standard binary search. The goal is to…
Slice literal definition and nil definition in goalng
In Go, slices are a reference type that can point to an underlying array. The differences between a slice that’s defined as a literal and one that’s defined as nil are as…
Understand RESTful API and Tests in One Post
RESTful APIs (Representational State Transfer APIs) are an architectural style for networked applications on the web, designed to take advantage of existing protocols. They are used to set rules that allow services…
Fisher-Yates algorithm in Java
The Fisher-Yates algorithm is a method for generating a random permutation of a finite sequence. Here is how you can integrate the Fisher-Yates shuffle algorithm in the existing Java class: Here is…