## Fast Fourier Transformation for poynomial multiplication

Given two polynomial A(x) and B(x), find the product C(x) = A(x)*B(x). There is already an O() naive approach to solve this problem. here. This… Read More »

- Maximum element in a sorted and rotated array
- Count the triplets such that A[i] < B[j] < C[k]
- Complexity Analysis of Binary Search
- Interactive Problems in Competitive Programming
- Lazy Propagation in Segment Tree | Set 2
- Maximum Sum SubArray using Divide and Conquer | Set 2
- Find minimum steps required to reach the end of a matrix | Set - 1
- Sum of maximum of all subarrays | Divide and Conquer
- Kth smallest element in the array using constant space when array can't be modified
- Find minimum steps required to reach the end of a matrix | Set 2
- IntroSort or Introspective sort
- Cost Based Tower of Hanoi
- Cartesian tree from inorder traversal | Segment Tree
- Find the number of different numbers in the array after applying the given operation q times
- Modular Exponentiation of Complex Numbers
- Find an N x N grid whose xor of every row and column is equal

Given two polynomial A(x) and B(x), find the product C(x) = A(x)*B(x). There is already an O() naive approach to solve this problem. here. This… Read More »

We have to paint n boards of length {A1, A2, .. An}. There are k painters available and each takes 1 unit time to paint… Read More »

Given an array of sorted integers. We need to find the closest value to the given number. Array may contain duplicate values and negative numbers.… Read More »

We have to paint n boards of length {A1, A2…An}. There are k painters available and each takes 1 unit time to paint 1 unit… Read More »

Given a tank with capacity C liters which is completely filled in starting. Everyday tank is filled with l liters of water and in the… Read More »

Given an array of 2n elements in the following format { a1, a2, a3, a4, ….., an, b1, b2, b3, b4, …., bn }. The… Read More »

I was contacted by the HR on LinkedIn about the opening of Full Stack Developer at PayTM Noida. 1st Round (Duration – 2 hours) Tell… Read More »

Round 1 (Online Test): Four Programming Questions- a) Given a string find number of different substrings that are palindromes. b) In a matrix we can… Read More »

We are given a sorted array A[] of n elements. We need to find if x is present in A or not.In binary search we… Read More »

Given two integers m & n, find the number of possible sequences of length n such that each of the next element is greater than… Read More »

Given two sorted arrays. There is only 1 difference between the arrays. First array has one element extra added in between. Find the index of… Read More »

A convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified by their x and y… Read More »

Given two sorted arrays of size m and n respectively, you are tasked with finding the element that would be at the k’th position of… Read More »

Given many stacks of coins which are arranged adjacently. We need to collect all these coins in the minimum number of steps where in one… Read More »

An element is a peak element if it is greater than or equal to its four neighbors, left, right, top and bottom. For example neighbors… Read More »