Given an array of integers. The task is to find the Minimum index of repeating element in an array in linear time and in a single traversal of the array. Examples: Input : {5, 6, 2, 1, 6, 1, 2} Output : Minimum index of repeating element is 1 Input : {1, 2, 5, 6, 7} Output :… Read More »
Given an array of size N. The task is to choose an arbitrary pair of elements from the Array such that their sum is even, delete these two elements from the Array and insert their sum into the sequence instead. And finally, count the number of elements remaining in the array at the end. Examples: Input:N = 2,… Read More »
There are N student from class 12th,each student finished thier exam and exam consist with four subjects like math, computer, physics and chemistory. Result is announced and result list consist with student identity number with their corresponding marks scored in each subject. Our task is to find ranked student among the N student. Example: Suppose there are 5… Read More »
We have to create an inverse triangle in the form of numbers (decreasing order). Example: If the user provide 5. The print 5, 5 times ; 4, 4 times and so on. As- 5 5 5 5 5 4 4 4 4 3 3 3 2 2 1 Implementation: First we declare a variable – number and assign… Read More »
Given an integer array arr[], the task is to find the number of triplets at distinct indices that can be removed from the array such that the mean remains the same as before. Example: Input: arr[]= { 8, 7, 4, 6, 3, 0, 7} Output: 3 Explanation: The mean of the array is (8+7+4+6+2+1+7)/7 = 5 On removal… Read More »
Given a non negative number, you are required to find whether or not the number can be composed from sum of some number of 7s, 5s and 3s i.e. if a number is of the format n=3x+5y+7z (x, y, z being non negative integers), if not print -1. If it is of the required format, print the number… Read More »
In this article, we will discuss some of similar questions that are easy to solve with few changes in solution codes. Leetcode is a platform to practice DSA problems for those who want to learn DSA and practice these online. You can practice those DSA problems and qualify the DSA round of many product based companies to become… Read More »
Given an array of size n, your task is to find the least common multiple or LCM of all the elements of the array. Examples: Input : arr = [ 8, 9, 21] Output : 504 Input : arr = [ 2, 4, 3, 8] Output : 24 RECOMMENDED: Maximum Length Subsequence from Ticket Prices Array Method-1: Prime… Read More »
We have to find a Matrix of order 3 formed by given 9-elements whose determinant is maximum. Examples: Input: arr[9] = { 1, 2, 3, 4, 5, 6, 7, 8, 9} Max determinant possible = 412 Matrix Resulting max determinant = { 9, 4, 2, 3, 8, 6, 5, 1, 7 } Input: arr[3][3] = { 0, 2,… Read More »
The first few terms(Fn) of Fibonacci Numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, … For given N find the sum (Sn) of 0 to nth term of a fibonacci series. Sn = Fn+ Fn-1+ …+ F1+ F0 // Naive Method Sn = Fn+2 – 1 // Advanced method Examples:… Read More »
