## Maximize the total profit of all the persons

There is a hierarchical structure in an organization. A party is to be organized. No two immediate subordinates can come to the party. A profit… Read More »

- Practice for cracking any coding interview
- How to get rid of Java TLE problem
- How can one become good at Data structures and Algorithms easily?
- Burst Balloon to maximize coins
- Subset array sum by generating all the subsets
- Understanding The Coin Change Problem With Dynamic Programming
- Sum of similarities of string with all of its suffixes
- Reach the numbers by making jumps of two given lengths
- Find triplets in an array whose AND is maximum
- Maximize the total profit of all the persons
- Length of the longest Subarray with only Even Elements
- Check if a number is perfect square without finding square root
- Print matrix in snake pattern from the last column
- Sort the array of strings according to alphabetical order defined by another string
- Introduction to Programming Languages
- Number of quadrilaterals possible from the given points
- Some useful C++ tricks for beginners in Competitive Programming
- How to read Competitive Programming Questions?
- How can competitive programming help you get a job?
- Minimum number of increasing subsequences
- Python in Competitive Programming
- Sum of the first N Prime numbers
- Sum of the multiples of two numbers below N
- Check if any permutation of a large number is divisible by 8
- Number of array elements derivable from D after performing certain operations
- Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)
- Minimum cost to buy N kilograms of sweet for M persons
- Smallest Pair Sum in an array
- Minimum changes required to make two arrays identical
- Minimum cost path from source node to destination node via an intermediate node

There is a hierarchical structure in an organization. A party is to be organized. No two immediate subordinates can come to the party. A profit… Read More »

Shortcode is ideal in competitive programming because programs should be written as fast as possible. Because of this, competitive programmers often define shorter names for… Read More »

Measuring frequency of elements in an array is a really handy skill and is required a lot of competitive coding problems. We, in lot of problems… Read More »

Given Q queries and an empty list. The queries can be of two types: addToList(x) : Add x to your list. removeFromList(x) : Remove x… Read More »

Given a, b and c which are part of the equation x = b * ( sumdigits(x) ^ a ) + c. Where sumdigits(x) determines… Read More »

Given an undirected weighted graph. The task is to find the minimum cost of the path from source node to the destination node via an… Read More »

Given a perimeter P, the task is to find the number of right triangles possible with perimeter equal to p. Examples: Input: P = 12… Read More »

Given a number n, we need to find the last two digits of 2n. Examples: Input : n = 7 Output : 28 Input :… Read More »

Given an array of N numbers and an integer K. The task is to print the number of unique subsequences possible of length K. Examples:… Read More »

Given an array of N positive integers. The task is to perform the following operations according to the type of query given. 1. Print the… Read More »

Given two integers L and R. The task is to find the sum of all prime factors of every number in the range[L-R]. Examples: Input:… Read More »

Prerequisites: Fenwick Tree (Binary Indexed Tree) Given an array of N numbers, and a number of queries where each query will contain three numbers(l, r… Read More »

A computer is a computational device which is used to process the data under the control of a computer program. Program is a sequence of… Read More »

Given a number N, create an array such the first half of the array is filled with odd numbers till N and second half of… Read More »

Given two binary strings. The task is to check if string s1 can be converted to string s2 by performing the given operations any number… Read More »