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
C++ program for finding nth term of H.P.
What is Harmonic Progression? A Harmonic Progression is a sequence of numbers formed by the reciprocal of an Arithmetic progression sequence. If a given sequence a1, a2, a3, a4... is in Arithmetic progression, then 1/a1, 1/a2, 1/a3, 1/a4... forms a Harmonic Progression. Formula for the nth term of Harmonic Progression? The formula for the nth term of a Harmonic Progression is: Tn = 1 / (1/a1 + (n - 1) * d) where: a1 is the first term of the Harmonic Progression. d is the common difference of the corresponding Arithmetic ...
Read MoreHow to Extract Email Addresses from Gmail Messages
To extract email addresses from Gmail Messages, you have to use google sheets also Apps Script for automation. Open a New google sheets and navigate to Extensions. Then, set up script that scan your mailbox and lists sender emails address in the google sheets automatically. Here's is step-by-step procedure to extract email addresses from Gmail messages is given follow these steps:- Step 1: Open Google Sheets Go to Google Sheets and create a new or Blank sheets. Step 2: Open Apps Script Click on Extension on clicking you will see many option among them select Apps Script. Step 3: ...
Read MoreHow to deallocate a 2D array in C++
In this article, we will learn how to deallocate a 2D array in C++. A 2D array is an array of arrays, where each element points to another array. When you dynamically allocate a 2D array, memory is reserved for each row and the main array on the heap. Deallocating memory means freeing the memory that was previously allocated for the 2D array so it can be reused. In C++, this involves deleting each row first and then deleting the main array. Deallocating a 2D Array in C++ In C++, a 2D array can be dynamically allocated in ...
Read MoreSend Confirmation Emails with Google Forms
What is Google Forms? Google Forms is a user-friendly tool used for creating surveys, quizzes and making forms quickly and easily. The key features of Google Forms include:- Free to use and customizable form: It's completely free and integrated with google workspace tools like google drive, Email as well as Sheets. You can create a form with multiple question types as per your need like multiple choice, checkboxes etc. Collects Responses: Responses are automatically collected and organized in google forms itself. Quiz mode: You can turn your ...
Read MoreConvert HashSet to TreeSet in Java
In this article, we will learn to convert a HashSet to a TreeSet in Java. Converting from one type of collection to another is a simple process when we require them to change their behavior or the nature of our data structure. Why Convert HashSet to TreeSet? For the following operations, we can convert a HashSet to a TreeSet − Sorted Order: TreeSet maintains elements in ascending order. Range-Based Operations: It supports operations like headSet(), tailSet(), and subSet(). NavigableSet Features: TreeSet provides methods like higher(), lower(), ceiling(), ...
Read MoreJava Program to Implement the Linear Congruential Generator for Pseudo Random Number Generation
In this article, we will implement the linear congruential generator for pseudo random number generation in Java. Pseudo random number generator (PRNG) are mainly used in simulations, cryptography, or mathematical tasks. What is an LCG? A Linear Congruential Generator (LCG) is a technique to generate a sequence of numbers that looks like random numbers but are actually determined. It is one of the reasons to call it a pseudo-random number. The Linear Congruential Generator (LCG) technique generates a random number based on the previous number and uses linear recurrence to generate the sequence of the random number. Mathematical Formula We can ...
Read MoreDifference between List and Set in Java
In Java, List and Set are both interfaces that belong to the Collection framework. Both interfaces extend the Collection interface. They are both used to store a collection of objects as a single unit. Before JDK 1.2, we used to use Arrays, Vectors, and Hashtable for grouping objects as a single unit. Difference Table The following are the key differences between List and Set − Sr. No. ...
Read MoreMinimum sum of differences with an element in an array
Problem Statement In this problem, we are given an array of integers, and we have to select a particular element from the array such that the sum of absolute differences between that element and all other elements is minimized. Example 1 Input: arr = [3, 1, 2, 5, 4] Output: 6 Explanation: If we select 3 as the element, the sum of differences is: |3-1| + |3-2| + |3-3| + |3-4| + |3-5|= 2 + 1 + 0 + 1 + 2 = 6 ...
Read MoreHow to install and setup Deepseek in laptop
What is DeepSeek? DeepSeek is one of the most advanced AI platform for its language Modes, high-performance and cost-efficient. DeepSeek offers various models such as DeepSeek-V3 and DeepSeek-R1 are basically designed for tasks like coding, reasoning etc. It offers open-source alternatives to other AI, making it accessible for developers and businesses. Prerequisites To Install DeepSeek DeepSeek AI application can be installed on various Operating systems. such as - Operating System 1.Windows 10 or later 2.Linux(Ubuntu 18.04 or later) 3.macOS 10.15 or later Hardware requirements 1. CPU Multi-core processor (Quad- core or higher recommended) 3. RAM Minimum 8GB (16GB recommended for ...
Read MoreReduce a given array by replacing all subarrays with values less than a given number K by their sum
In this article, we will learn how to reduce a given array by replacing all subarrays with values less than a given number K by their sum. This process simplifies the array by merging smaller values. Given an array of integers and a value K, we need to find all contiguous subarrays whose values are less than K and replace them with their sum. After performing this reduction, the resulting array will have fewer elements, as the smaller subarrays will be combined into one. Let's consider an example. Given the array: [1, 2, 3, 5, 1, 4, 6, ...
Read More