## Quickhull Algorithm for Convex Hull

Given a set of points, a Convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified… Read More »

- Maximum element in a sorted and rotated array
- Count the triplets such that A[i] < B[j] < C[k]
- Interactive Problems in Competitive Programming
- Complexity Analysis of Binary Search
- Minimum steps to delete a string by deleting substring comprising of same characters
- 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
- IntroSort or Introspective sort
- Find minimum steps required to reach the end of a matrix | Set 2
- Largest number N which can be reduced to 0 in K steps
- Find 2^(2^A) % B
- Cost Based Tower of Hanoi
- Find the number of different numbers in the array after applying the given operation q times
- Find the value of XXXX.....(N times) % M where N is large
- Modular Exponentiation of Complex Numbers
- Cartesian tree from inorder traversal | Segment Tree
- Sum of i * countDigits(i)^2 for all i in range [L, R]

Given a set of points, a Convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified… Read More »

Given an array representing n positions along a straight line. Find k (where k <= n) elements from the array such that the maximum distance… Read More »

Given number of pages in n different books and m students. The books are arranged in ascending order of number of pages. Every student is… Read More »

I have applied for Graphics Software Engineer position through LinkedIn. I was called for interview after 2 weeks of applying. Interview took place in Bangalore… Read More »

Strassen’s matrix is a Divide and Conquer method that helps us to multiply two matrices(of size n X n). You can refer to the link,… Read More »

Consider an array of distinct numbers sorted in increasing order. The array has been rotated (clockwise) k number of times. Given such an array, find… Read More »

Given a matrix of N rows and M columns, the task is to find the minimum absolute difference between any of the two adjacent elements… Read More »

You are given a bitonic sequence, the task is to find Bitonic Point in it. A Bitonic Sequence is a sequence of numbers which is… Read More »

Given a sorted array of n elements containing elements in range from 1 to n-1 i.e. one element occurs twice, the task is to find… Read More »

Given a sorted array and a value x, the floor of x is the largest element in array smaller than or equal to x. Write… Read More »

Given a number n, find the cube root of n. Examples: Input: n = 3 Output: Cubic Root is 1.442250 Input: n = 8 Output:… Read More »

Given an sorted array of positive integers, count number of occurrences for each element in the array. Assume all elements in the array are less… Read More »

Given a set of strings, find the longest common prefix. Examples: Input : {“geeksforgeeks”, “geeks”, “geek”, “geezer”} Output : “gee” Input : {“apple”, “ape”, “april”}… Read More »

Given three numbers x, y and p, compute (xy) % p. Examples : Input: x = 2, y = 3, p = 5 Output: 3… Read More »

Given an integer x, find square root of it. If x is not a perfect square, then return floor(√x). Examples : Input: x = 4… Read More »