- Courses
- Tutorials
- Jobs
- Practice
- Contests
Count number of increasing subsequences of size kGiven an array arr[] containing n integers. The problem is to count number of increasing subsequences in the array of size k.Examples:Input : arr[] = {2, 6, 4, 5, 7}, ... Read More
Sum of the series 1 + (1+2) + (1+2+3) + (1+2+3+4) + ...... + (1+2+3+4+...+n)Given the value of n, we need to find the sum of the series where i-th term is sum of first i natural numbers.Examples :Input : n = 5 Output : 35Explanation :(1) + (1+2... Read More
Minimum insertions to make a Co-prime arrayGiven an array of N elements, find the minimum number of insertions to convert the given array into a co-prime array. Print the resultant array also.Co-prime Array : An ar... Read More
Check if given number is Emirp Number or notAn Emirp Number (prime spelled backwards) is a prime number that results in a different prime when its decimal digits are reversed. This definition excludes the related pa... Read More
Program to print reverse character bridge patternFor a given value N, denoting the number of Charters starting from the A, print reverse character bridge pattern.Examples :Input : n = 5Output : ABCDEDCBA ABCD DCBA ABC ... Read More
Minimum number of points to be removed to get remaining points on one side of axisWe are given n points in a Cartesian plane. Our task is to find the minimum number of points that should be removed in order to get the remaining points on one side of any... Read More
Program for Binomial Coefficients tableGiven an integer max, print Binomial Coefficients table that prints all binomial coefficients B(m, x) where m and x vary from 0 to maxExample :Input : max = 3Output : 0 ... Read More
Rearrange array such that even positioned are greater than oddGiven an array arr[] of N elements, sort the array according to the following relations:arr[i] = arr[i - 1], if i is even,∀ 1 = i Narr[i] = arr[i - 1], if i is odd,∀ 1 = ... Read More
File Organization in DBMS | Set 2Pre-Requisite: Hashing Data StructureIn a database management system, When we want to retrieve a particular data, It becomes very inefficient to search all the index value... Read More
Partition into two subsets of lengths K and (N - k) such that the difference of sums is maximumGiven an array of non-negative integers of length N and an integer K. Partition the given array into two subsets of length K and N - K so that the difference between the s... Read More
Program to generate random alphabetsPrerequisite : rand() and srand()Given all alphabets in a character array, print a string of random characters of given size.We will use rand() function to print random ch... Read More
Database Objects in DBMSA database object is any defined object in a database that is used to store or reference data.Anything which we make from create command is known as Database Object.It can... Read More
queue::front() and queue::back() in C++ STLQueue are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back (end) and are deleted from the f... Read More