Manisha Chand

Manisha Chand

Words That Decode Code

About

A Passionate technical content writer with hands-on experience in C++, Java, Python, and JavaScript. I create clear, easy-to-follow tutorials and guides for beginners as well as professional developers. Skilled in HTML, CSS, SQL, and Machine Learning Concepts. I focus on turning complex technical topics into simple and useful content.

26 Articles Published

Articles by Manisha Chand

26 articles

Java Program to Find Even Sum of Fibonacci Series till number N

Manisha Chand
Manisha Chand
Updated on 11-Mar-2026 3K+ Views

In this article, we will learn how to find the even sum of the Fibonacci series up to a given number N. A Fibonacci series is a series where the next term is the sum of the previous two terms. An even Fibonacci series is a group of all the even numbers in the Fibonacci series. The first two terms of the Fibonacci sequence are 0 and 1. Fn = Fn-1 + Fn-2 Hence, a Fibonacci series can look like this - F8 = 0 1 1 2 3 5 8 13 or, this F8 = 1 1 2 3 5 ...

Read More

Java program to calculate the compound interest

Manisha Chand
Manisha Chand
Updated on 11-Mar-2026 16K+ Views

In this article, we will understand how to calculate compound interest in Java. Compound interest is calculated using the following formula. Amount = P(1 + R/100)t Compound Interest = Amount - Principle where, P is the principal amount T is the time R is the rate Compound interest is the interest calculated on the initial principal and also on the accumulated interest of previous periods. In other words, Compound Interest = Interest on Principal + Interest on Interest. We'll learn how to get user input for the principal amount, interest rate, and time period, and then calculate the compound interest based ...

Read More

Java Program to Check if two of three Boolean variables are true

Manisha Chand
Manisha Chand
Updated on 11-Mar-2026 545 Views

In this article, we will learn to check if any two out of three boolean values are true or not. Boolean variables are datatypes that contain only true or false values. Below is a demonstration of the same - Input: true, true, falseOutput : Two of the three variables are true Checking if two of three Boolean variables are trueIn this article, we will discuss two approaches to check it, and they are - Using if-else Condition ...

Read More

Java program to print downward triangle star pattern

Manisha Chand
Manisha Chand
Updated on 22-Aug-2025 1K+ Views

In this article, we will understand how to print a downward triangle star pattern using Java. In this pattern, the face of the triangle will be in a downward direction, and the base will be in an upward direction. We will learn through two examples: one where the user inputs the number of rows, and another where the number of rows is predefined in the program. Problem Statement Write a Java program to print a downward triangle star pattern. Below is a demonstration of the same. Input: Enter the number of rows : 8 Output: The downward triangle star pattern ...

Read More

Java Program to Interchange the Diagonals

Manisha Chand
Manisha Chand
Updated on 22-Aug-2025 424 Views

In this article, we will understand how to interchange the diagonal elements of a given matrix in Java. A matrix is a two-dimensional array made up of rows and columns. A matrix with m rows and n columns is called an m × n matrix. Each element in the matrix is represented by a[i][j], which means that the particular element a is present in the i-th row and j-th column. Problem Statement Write a Java program to interchange the elements of the primary and secondary diagonals of a square matrix. Example Scenario ...

Read More

Angle between a chord and a tangent when angle in the alternate segment is given in C++?

Manisha Chand
Manisha Chand
Updated on 08-Aug-2025 253 Views

In this problem, we are given a circle whose chord and tangent meet at a particular point. The angle in the alternate segment of a circle is given. We need to find the angle between the chord and the tangent. According to the Alternate Segment Theorem the angle between a chord and a tangent is equal to the angle in the alternate segment of the circle. Chord and Tangent The chord of a circle can be defined as the line segment joining any two points on ...

Read More

Adding two polynomials using Linked List in C++.

Manisha Chand
Manisha Chand
Updated on 06-Aug-2025 28K+ Views

Adding two Polynomials using a Linked List in C++ Linked list is a data structure that stores each element as an object in a node of the list. Every node contains two parts data node and links to the next node. A polynomial is a mathematical expression that consists of variables and coefficients. For example, x^2 - 4x + 7. In the Polynomial linked list, the coefficients and exponents of the polynomial are defined as the data node of the list. For example, if the given Polynomial equation is: 4x7 + 12x2 + 45. Its representation in a linked list looks like: ...

Read More

All unique triplets that sum up to a given value in C++

Manisha Chand
Manisha Chand
Updated on 31-Jul-2025 531 Views

Unique Triplets that Sum up to a Given Value In this article, we will discuss different approaches to find all the unique triplets that sum up to the given value. Before that, first understand the given problem. We have been given an integer array with N elements, along with a target value. Our task is to find unique or distinct triplets (i.e., three numbers) from an array, whose sum is the same as the target value. Let's take a scenario to understand the problem in a better way: Scenario 1 Input: arr ={1, 2, 3, 4, 5, 6, 7} ...

Read More

Almost Perfect Number in C++

Manisha Chand
Manisha Chand
Updated on 31-Jul-2025 328 Views

Almost Perfect Number in C++ Almost Perfect Number is a positive integer n for which the sum of all its positive proper divisors (excluding the number itself ) is equal to n-1. (i.e., one less than the number n). It is also known as the least deficient number or slightly defective number. A positive proper divisor is a divisor of a number, excluding the number itself. For example, for n = 6; 1, 2, 3 are positive proper divisors but 6 itself is not. In Mathematics, we say A number n is almost perfect if: σ(n)-n = n-1 by ...

Read More

Aliquot sum in C++?

Manisha Chand
Manisha Chand
Updated on 31-Jul-2025 389 Views

Aliquot sum in C++ Aliquot sum of a positive integer n is the sum of all proper divisors of n. A positive proper divisor is a divisor of a number, excluding the number itself. For example, for n = 6; 1, 2, 3 are positive proper divisors but 6 itself is not. Scenario 1 Input: n = 20 Output: 22 Explanation: Proper divisors of 20 are: 1, 2, 4, 5, 10 Sum of proper divisors are: 1 + 2 + 4 + 5 + 10 = 22 So, aliquot sum of 20 is : 22 Scenario 2 Input: 15 ...

Read More
Showing 1–10 of 26 articles
« Prev 1 2 3 Next »
Advertisements