Introduction Finding the Time and Space Complexities from codes of a piece of code is an important step in understanding its performance and optimizing it for efficiency. In this article, we will explore the basic concepts of time and space complexity, and how to determine them from a given piece of code. Time Complexity Time …
INTRODUCTION Write a program to Check whether the given number is a palindrome. A palindrome number is a number that is as same as the original number when it is reversed. APPROACH: To check whether the given number is palindrome or not, we will check the number by reversing it and comparing it with the …
Check whether the given number is a palindrome. Read More »
INTRODUCTION Given an integer n, write a program TO PRINT ALL DIVISORS OF A GIVEN NUMBER. Here’s an algorithm to find all divisors of a given number: Start a loop from 1 to the given number. For each iteration, check if the current number (i) is a divisor of the given number by using the …
INTRODUCTION CHECK WHETHER THE GIVEN NUMBER IS ARMSTRONG OR NOT. The Armstrong number of n digits is a number in which the sum of each digit of the number with power n is equal to the original number. The Armstrong number is also known as the Narcissist number. Let’s look at an example for a better …
INTRODUCTION Write a program to REVERSE THE GIVEN NUMBER. APPROACH: The idea behind reversing a given number is to extract the last digit of the number and form a new number in the reverse order. To extract the last digit, we will simply divide the number by 10, the remainder which results out is the …
INTRODUCTION Given an integer n, write a program TO CHECK WHETHER THE GIVEN NUMBER IS PRIME NUMBER OR NOT Some more prime numbers are 2,3,5,7,11,13,17,19,23,29,31,37,41,43 and so on. APPROACH1 A prime number is a natural number which is only divisible by 1 and itself. So if we divide the number by running a loop from …
TO CHECK WHETHER THE GIVEN NUMBER IS PRIME NUMBER OR NOT Read More »
In this article, we are going to FIND THE LCM and GCD OF TWO NUMBERS. GCD The greatest common divisor(GCD) or the highest common factor(HCF) of two or more numbers is the highest common number that divides the given number exactly. For example, As 5 is the greatest common factor of 10 and 15. APPROACH …
In the next few articles, we are going to learn some basic math problems that are very crucial to learn Data structures and algorithms. Let’s start with the COUNT DIGITS IN A NUMBER with solution code in c++, java, and python. Problem Statement Given an integer N, write a program to check whether the given …
In this article we are going to learn about the following content:- What are pattern problems? Why are they useful before starting DSA? Initial pattern code. Explanation. Must do pattern problems before starting DSA What are pattern problems? Almost everything we see in our daily life has a certain pattern to it i.e. stars have …
Introduction In this article, let’s have a look at physical vs logical data structures. Physical DataStructures Physical data structures are the actual implementations of data structures in memory. They determine the performance and efficiency of algorithms that use the data structure, by determining how the data is stored and accessed in memory. For example, a …
We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.
