## Minimum multiplications with {2, 3, 7} to make two numbers equal

Given two numbers A and B, the task is to find the minimum number of operations required to make A and B equal. In each… 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
- Print matrix in snake pattern from the last column
- Check if a number is perfect square without finding square root
- Sort the array of strings according to alphabetical order defined by another string
- Number of quadrilaterals possible from the given points
- Minimum number of increasing subsequences
- Introduction to Programming Languages
- How can competitive programming help you get a job?
- How to read Competitive Programming Questions?
- Check if any permutation of a large number is divisible by 8
- Sum of the multiples of two numbers below N
- Python in Competitive Programming
- Number of array elements derivable from D after performing certain operations
- Minimum cost to buy N kilograms of sweet for M persons
- Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)
- Sum of the first N Prime numbers
- Smallest Pair Sum in an array
- Minimum cost path from source node to destination node via an intermediate node
- Kth Smallest sum of continuous subarrays of positive numbers
- Find three integers less than or equal to N such that their LCM is maximum

Given two numbers A and B, the task is to find the minimum number of operations required to make A and B equal. In each… Read More »

Given a Large number N ( number of digits in N can be up to 105). The task is to find the cuts required of… Read More »

Given a integer k and a sting str, the task is to count the number of distinct sub-strings such that each sub-string does not contain… Read More »

Given a string of consecutive digits and a number Y, the task is to find the number of minimum sets such that every set follows… Read More »

Given an array A[] of size N / 2, the task is to construct the array B[] of size N such that: B[] is sorted… Read More »

Given N bracket sequences, the task is to find the number of pairs of bracket sequences by joining which can be obtained a balanced bracket… Read More »

Given an array arr[] and an integer K, the task is to count the number of sub-arrays having bitwise OR ≥ K. Examples: Input: arr[]… Read More »

Given a doubly linked list ‘L’ and an array ‘refArr’ of references to the nodes of the doubly linked list ‘L’. Array 'refArr' does not… Read More »

Given two integers N and K where K < N, the task is to generate a permutation of integers from 1 to N such that… Read More »

Given an integer N, the task is to find the minimum absolute difference between N and a power of 2. Examples: Input: N = 4… Read More »

Given an encrypted string str, the task is to decrypt the given string when the encryption rules are as follows: Start with the first character… Read More »

Given a string str, the task is to print all the sub-sequences of str. A subsequence is a sequence that can be derived from another… Read More »

Given two integers n and k, the task is to find whether it is possible to represent n as the sum of exactly k powers… Read More »

In a given Cartesian plane, there are N points. The task is to find the Number of Pairs of points(A, B) such that Point A… Read More »

We need to check whether a number is a perfect square or not without finding its square root. Examples: Input : n = 36 Output… Read More »