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
In-Memory Database Explained
Introduction The burgeoning field of technology constantly introduces innovations designed to boost efficiency, speed, and productivity in diverse arenas, among which data management holds paramount importance. The traditional disc-based databases have played a significant role in data management for years. However, with data volumes escalating exponentially, businesses worldwide are looking for ways to expedite data processing. In this scenario, in-memory databases (IMDBs) stand as a revolutionary alternative. Understanding In-Memory Databases An in-memory database (IMDB) is a database management system that primarily relies on main memory (RAM) for data storage rather than traditional disk storage. This storage scheme empowers IMDBs to ...
Read MoreIaaS API Explained
In the era of digital transformation, cloud computing has become the bedrock of modern infrastructure. This paradigm shift has brought forth three cloud service models: Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS). This article focuses on Infrastructure as a Service (IaaS) and, more specifically, its Application Programming Interface (API). Understanding IaaS and IaaS API Before diving into IaaS APIs, let's understand what IaaS is. IaaS is a cloud computing model that provides virtualized computing resources over the internet. It provides users with raw compute, storage, and network resources that they can ...
Read MoreHow to Write a Mobile-Friendly App Using JQuery & Bootstrap?
The paradigm shift towards mobile technology has paved the way for a responsive, user-friendly interface in app design. JQuery and Bootstrap are two powerful tools that can aid developers in creating mobile-friendly applications. Let's delve into how you can use these frameworks to create an efficient, responsive application. Prerequisites Before you begin, ensure that you have a basic understanding of HTML, CSS, and JavaScript. Familiarity with JQuery and Bootstrap is advantageous but not compulsory, as we'll go over the basics. Introduction to JQuery & Bootstrap JQuery − A fast, small, and feature-rich JavaScript library, JQuery makes things like HTML document ...
Read MoreHow to concatenate two files into a new file using Python?
In Python, concatenation is a process that refers to combining two or more strings, lists, or such sequence-like objects into a single object. The concatenation operation when performed is denoted by using the "+" operator. Concatenating two files into a single file can be a useful process when you want to combine the contents of several files. If you want to merge data from different sources or simply create a consolidated file with aggregated data, Python provides a simple no-frills method to accomplish this task. In this article, we will explore different ways of concatenating two files into a ...
Read MoreIntroduction to Bootstrap plot
The visual depiction of data is essential in the field of data analysis. Bootstrap plots are extremely effective data visualisation tools that provide uncertainty estimates graphically. This article introduces the idea of bootstrap plots and provides clear instructions for making them in Python. Unraveling the Concept of Bootstrap Plots Bootstrap plots, which are often based on resampling with replacement, are graphic displays used to visualise uncertainty estimates. The bootstrap method uses many small data samples to average estimates from to estimate quantities about a population. The relevant data are plotted on the x-axis of a bootstrap plot, and the bootstrapped ...
Read MoreFind all Words from String Present after Given N Words
In this problem, we will find each word of the string which comes after all words of the ‘words’ array. The first approach to solve the problem is to split the string into words and match elements of the words[] array with the string words. If we find words[] array’s element in the same order inside the string, we print the next word of the string. Another approach is to create a string of all elements of the words[] array. After that, we can find that string as a substring in the alpha string. If we find it as a ...
Read MoreFind a Number Such that Sum of N with it is a Palindrome
In this problem, we will find the string of length equal to the given string so that when we sum both strings, we get the palindromic strings. Here, we can find another string such that the sum of both becomes 99999…, the largest palindromic string of the same length. If the given string starts with the ‘9’, we can find another string such that the sum of both becomes ‘11111…’. Problem statement – We have given a num string containing the numeric digits. We need to find the numeric string of the same length without leading zeros so that ...
Read MoreCount ways to Split String into K Substrings Starting with Even Digit and Min Length M
In this problem, we will count ways to partition the given string into the K substrings such that it follows the condition given in the problem statement. We will use the recursion to solve the problem. Also, we will use the tabular dynamic programming approach to solve the problem efficiently. Problem statement − We have given a string named bin_Str of a particular length. The string contains only numeric digits from ‘0’ to ‘9’. We need to count the number of ways to partition the string in K substrings such that it follows the below condition. The substring should ...
Read MoreCount Substrings with Number of 0s and 1s in Ratio of X : Y
In this problem, we will count substrings of the given binary string containing the number of ‘0’ and ‘1’ characters in the X : Y ratio. The naïve approach finds all substrings of the given binary string, counts ‘0’ and ‘1’, and checks whether the counts are in the X : Y ratio. The efficient approach uses the prefix sum technique to solve the problem. Problem statement − We have given a binary string of length bin_len. We need to count substrings having a number of 0s and 1s in the ratio of X : Y. Sample examples Input ...
Read MoreCount Substrings that can be Made of Length 1 by Replacing \"01\" or \"10\" with 1 or 0
In this problem, we will count substrings that we can make of length 1 by replacing the ‘10’ and ‘01’ substrings with ‘1’ or ‘0’ characters. When any binary string contains an equal number of ‘0’ and ‘1’, we can always make it of length 1 by performing the replacement operations. So, the problem is solved by finding the substrings with equal numbers of ‘0’ and ‘1’. Problem statement − We have given a binary string named bin_str and of length bin_len. We need to count the total number of substrings that we can make of length 1 by ...
Read More