## Last digit of Product of two Large or Small numbers (a * b)

Given two large or small numbers, the task is to find the last digit of the product of these two numbers. Examples: Input: a =… Read More »

- Find the total guests that are present at the party
- Programs for printing pyramid patterns using recursion
- Count the number of holes in an integer
- Program to check if an Array is Palindrome or not
- Count how many times the given digital clock shows identical digits
- Replace array elements by sum of next two consecutive elements
- How to concatenate two Integer values into one?
- Cost of painting n * m grid
- Count Odd and Even numbers in a range from L to R
- Program to check if a number is divisible by sum of its digits
- Program to calculate product of digits of a number
- Position of a person diametrically opposite on a circle
- Check if the given array is mirror-inverse
- Print last character of each word in a string
- Find the sum of digits of a number at even and odd places
- Difference between while and do-while loop in C, C++, Java
- Check if it is possible to create a polygon with given n sides
- Check if a binary string contains consecutive same or not
- Difference between High Level and Low level languages
- Number of character corrections in the given strings to make them equal
- Reorder the position of the words in alphabetical order
- Remove first X rows and columns from a matrix
- Sum of all perfect numbers present in an array
- Print the first and last character of each word in a String
- Find the hypotenuse of a right angled triangle with given two sides
- Given number of matches played, find number of teams in tournament
- Increasing sequence with given GCD
- Smallest integer greater than n such that it consists of digit m exactly k times
- Menu Driven C++ Program for a Simple Calculator
- Find the number of ways to divide number into four parts such that a = c and b = d

Given two large or small numbers, the task is to find the last digit of the product of these two numbers. Examples: Input: a =… Read More »

Given an array, the task is to determine whether an array is a palindrome or not. Examples: Input: arr[] = {3, 6, 0, 6, 3}… Read More »

Given two integers n1 and n2, the task is to concatenate these two integers into one integer. Example: Input: n1 = 12, n2 = 34… Read More »

Given an array arr[], the task is to find whether the array is mirror inverse. Inverse of an array means if the array elements are… Read More »

Given an array arr[] and an integer K, the task is to find the Kth odd element from the given array. Examples: Input: arr[] =… Read More »

Given an integer n and let a = 1, b = 2, c= 3, ….., z = 26. The task is to find the minimum… Read More »

Given three different alphabets ‘a’, ‘b’ and ‘c’ with a certain rule that after every 2 seconds every ‘a’ changes to a ‘b’, after every… Read More »

Problem Statement: Write a menu-driven program using the Switch case to calculate the following: Addition of two numbers Difference between two numbers Product of two… Read More »

Given two integers n and k, the task is to find the kth smallest element from the range [1, n] after deleting all the odd… Read More »

Consider two people moving in opposite direction with speeds U meters/second and V meters/second respectively. The task is to find how long will take to… Read More »

Given an integer M which is the number of matches played in a tournament and each participating team has played a match with all the… Read More »

Given an array arr[] of distinct elements and two integers M and K, the task is to generate an array from the given array elements… Read More »

Given a range [L, R]. The task is to find the total number of Hexadecimal alphabets that are required to write every number in the… Read More »

There are n people standing on the circumference of a circle. Given the position of a persom m, the task is to find the position… Read More »

Given N Big Candies and M Small Candies. One Big Candy can be bought by paying X small candies. Alternatively, one big candy can be… Read More »