## Number of ways N can be divided into four parts to construct a rectangle

Given an integer N, the task is to divide the number into four parts such that the divided parts can be used to construct a… Read More »

- Coin Change | BFS Approach
- Program to find the last two digits of x^y
- Count substrings that contain all vowels | SET 2
- Given two arrays count all pairs whose sum is an odd number
- Nth number whose sum of digit is multiple of 10
- Find maximum xor of k elements in an array
- Complexity Analysis of Binary Search
- Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
- Count of integers of length N and value less than K such that they contain digits only from the given set
- New Algorithm to Generate Prime Numbers from 1 to Nth Number
- Find the smallest positive number missing from an unsorted array | Set 3
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Create new linked list from two given linked list with greater element at each node
- Program to find the Nth Prime Number
- Find a triplet in an array whose sum is closest to a given number
- Find the minimum number of elements that should be removed to make an array good
- Find XOR of numbers from the range [L, R]
- Find sub-arrays from given two arrays such that they have equal sum
- Count total set bits in all numbers from 1 to n | Set 2
- Card Shuffle Problem | TCS Digital Advanced Coding Question
- Count pairs with given sum | Set 2
- Count of all possible values of X such that A % X = B
- Shortest path from source to destination such that edge weights along path are alternatively increasing and decreasing
- Maximum length of subarray such that sum of the subarray is even
- Append a digit in the end to make the number equal to the length of the remaining string
- Find a subarray whose sum is divisible by size of the array
- Find the Nth term divisible by a or b or c
- Maximum subsequence sum such that all elements are K distance apart
- Find the Nth Mosaic number
- Minimum steps to color the tree with given colors

Given an integer N, the task is to divide the number into four parts such that the divided parts can be used to construct a… Read More »

Given an integer N, the task is to find the count of natural Hexadecimal numbers with N digits. Examples: Input: N = 1 Output: 15… Read More »

Given an integer N, the task is to find the largest even and odd N-digit numbers in Octal Number System. Examples: Input: N = 4… Read More »

Given an array arr[] of size N and an integer K, the task is to find the number of K length subsequences of this array… Read More »

Given four integers a, b, c and d. The task is to check whether it is possible to pair them up such that they are… Read More »

Given a large integer as a string str, the task is find the number of matchsticks required to represent it. Examples: Input: str = “56”… Read More »

Count number of ways to arrange the first N natural numbers in a line such that the left-most number is always 1 and no two… Read More »

Given an array arr[] of N integers, the task is to find the probability of getting the maximum sum pair (arr[i], arr[j]) from the array… Read More »

Given a square with N points on each side of the square and none of these points co-incide with the corners of the square. The… Read More »

Given an array of length N + K. Also given the average avg of all the elements of the array. If an element that appears… Read More »

Given an integer N, the task is to find the count of N-digit numbers with all distinct digits. Examples: Input: N = 1 Output: 9… Read More »

Given an array arr[] of N non-negative integers, the task is to sort these integers according to the product of their digits. Examples: Input: arr[]… Read More »

Given four integers A, B, C and K. Assume that all the multiples of A, B and C are stored in a set in sorted… Read More »

Given an integer N, the task is to find the maximum number of distinct positive integers that can be used to represent N. Examples: Input:… Read More »

Given a Fibonacci number N, the task is to find the previous Fibonacci number. Examples: Input: N = 8 Output: 5 5 is the previous… Read More »