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
Articles on Trending Technologies
Technical articles with clear explanations and examples
How to Deploy RabbitMQ on Kubernetes?
Introduction RabbitMQ is a messaging broker that allows different applications to communicate with each other by sending and receiving messages. It provides a reliable and scalable way to handle messaging between systems. On the other hand, Kubernetes is an open-source container orchestration platform that automates the deployment, scaling, and management of containerized applications. With Kubernetes, you can easily deploy and manage your applications in a cloud-native environment. Preparing for Deployment Setting up a Kubernetes cluster Before deploying RabbitMQ on Kubernetes, it is necessary to set up a Kubernetes cluster. A Kubernetes cluster is made up of one or more ...
Read MoreHow To Deploy ONLYOFFICE Docs On Angular?
Introduction ONLYOFFICE Docs is a powerful self-hosted online office suite that allows users to edit and collaborate on documents. It offers advanced features such as document co-authoring, real-time editing, revision history, and third-party integrations. ONLYOFFICE is an open-source platform that works with different languages and frameworks. Angular, on the other hand, is a popular front-end framework for building web applications. It was developed by Google and provides robust support for building dynamic and scalable applications. With Angular, you can create complex web applications with minimal code. Prerequisites Required Software and Tools First, you will need to have Node.js installed. ...
Read MoreHow to Deploy a Bare Metal Cloud Server?
Introduction When it comes to cloud computing, there are two primary options: virtualized servers and bare metal servers. A virtual server runs on top of a hypervisor, which is essentially a layer of software that sits between the physical hardware and the operating system. In contrast, a bare metal server runs directly on the physical hardware without any intervening layers. A bare metal cloud server combines the benefits of both models. It provides dedicated hardware resources like a traditional bare metal server, but it's provisioned and managed through an API or web interface like a virtual server in ...
Read MoreGolang Program to Implement Kaden\'s Algorithm
There is a famous maximum sum subarray problem, in which we have a 1 Dimensional array and must find the maximum sum in that subarray. To solve this problem, the most naive approach will be to find all the sub − arrays, sum their elements, and return the maximum, but the time complexity will be O(N*N). To reduce this there is an algorithm that will reduce the time complexity from O(N*N) to O(N) named as Kadens Algorithm. In programming, there are algorithms based on the Dynamic programming concept in which the problem is broken into sub − problems and the ...
Read MoreGolang Program to Implement Binary Search Algorithm
In programming, to search for anything from an array, linked List, or any other data structures we have a few search algorithms, one of which is binary search. In binary search, the prerequisite is that the data should be sorted. In binary search, we follow the divide and conquer approach in which we divide the data by applying some conditions and then perform the operation on that data only. In this way, we reduce the time complexity. For example, if we have an array of elements {20, 44, 45, 54, 67, 88, 91} and we want to find 44 then ...
Read MoreGolang program to find the union of two arrays
In Golang, like other programming languages, we can find the union of two arrays. The union of two arrays is a list that consists of elements that lie in array A and the elements that lie in array B and common elements that lie in both arrays. For example, we have two arrays listed below A = {2, 9, 5, 7, 3} B = {5, 8, 7 2, 1} The union of the above arrays will be Union = {1, 2, 3, 5, 7, 8, 9} Method 1 In this method, we are going to find the union of two ...
Read MoreGolang Program to Find Max No. of 1 in a Sorted Row of the Matrix
In programming languages, we can create 2−Dimensional Matrices and store elements in them. The 2−Dimensional metric is a data structure that has rows and columns. In this article, we are going to see the two different logic to find the maximum no. of ones in a sorted row of the matrix. For example, we have below the matrix {0, 1, 1, 1}, no. of 1s = 3 {0, 0, 1, 1}, no. of 1s = 2 {1, 1, 1, 1}, no. of 1s = 4 {0, 0, 0, 0}, no. of 1s = 0 In the ...
Read MoreGolang program to find duplicates in N+1 array
In programming, there is a problem statement asked in interviews to find the duplicate number in an array of size N + 1. Also, there will be only one duplicate element in the array. The elements will be between 1 to N. For example, Array = {1, 3, 2, 1, 4} 1 is the duplicate element in the above array. Algorithm Step 1: Import the required packages at the top using the import keyword. Step 2: Then the main function will get run first. First, we are declaring and initialize the array. Now, we are calling the function to ...
Read MoreGolang Program Level Order Traversal of Binary Tree
In programming, there are different data structures to store data. There are two different types of data structures linear and non −linear. Array, stack, queue, and linked list are linear data structures. Binary trees, trie, etc are non − linear data structures. In this article, we are going to explore level order traversal on one of the non − linear data structures i.e. binary tree. Level Order Traversal In level order traversal, of a binary tree we start from the root node and then traverse the children nodes and move to the children of children nodes. In this way, ...
Read MoreGolang Program Left View of Binary Tree
In programming, there is a coding problem of binary tree that gets asked very frequently in interviews and the problem statement is to find the left view of a binary tree. If we try to understand the problem statement more than what exactly the left view is then we can explain it in a way that all the nodes are visible when you see them by standing on the left side of the tree. Illustration Let us understand more with the help of an example. Suppose we have a below tree and if we stand on the left side ...
Read More