Collection of solution for problems on InterviewBit
- Arrays
- Math
- Binary Search
- Strings
- Bit Manipulation
- Two Pointers
- Linked List
- Stacks And Queues
- BackTracking
- Hashing
- Heaps And Maps
- Trees
- Dynamic Programming
- Greedy
- Graphs
Given a non-negative number represented as an array of digits, add 1 to the number ( increment the number represented by the digits ). The digits are stored such that the most significant digit is at the head of the list.
**Example:** If the vector has **[1, 2, 3]** the returned vector should be ***[1, 2, 4]*** as 123 + 1 = 124.
**Note**: The result may be very large, so you need to return a string instead of an integer.
Given a read only array of n + 1 integers between 1 and n, find one number that repeats in linear time using less than O(n) space and traversing the stream sequentially O(1) times.
**Example:** For **[3, 4, 1, 4, 1]**, you should return ***1***.
**Note**: If there are multiple possible answers ( like in the sample case above ), output any one.
Given an unsorted integer array, find the first missing positive integer.
**Example:** For **[1,2,0]** return ***3***, **[3,4,-1,1]** return ***2***, **[-8, -7, -6]** returns ***1***
**Note**: Your algorithm should run in O(n) time and use constant space.
You are given a binary string(i.e. with characters 0 and 1) S consisting of characters S1, S2, …, SN. In a single operation, you can choose two indices L and R such that 1 ≤ L ≤ R ≤ N and flip the characters SL, SL+1, …, SR. By flipping, we mean change character 0 to 1 and vice-versa.
Your aim is to perform ATMOST one operation such that in final string number of 1s is maximised. If you don’t want to perform the operation, return an empty array. Else, return an array consisting of two elements denoting L and R. If there are multiple solutions, return the lexicographically smallest pair of L and R.
**Notes:** Pair (a, b) is lexicographically smaller than pair (c, d) if a < c or, if a == c and b < d.
**Example:** Given **S = 010**,
| Pair of [L, R] | Final string |
|---|---|
| [1 1] | 110 |
| [1 2] | 100 |
| [1 3] | 101 |
| [2 2] | 000 |
| [2 3] | 001 |
We see that two pairs [1, 1] and [1, 3] give same number of 1s in final string. So, we return [1, 1].
Example: Given S = 111,
No operation can give us more than three 1s in final string. So, we return empty array [].
Given a list of non negative integers, arrange them such that they form the largest number.
**Example:** Given **[3, 30, 34, 5, 9]**, the largest formed number is ***9534330***.
**Note:** The result may be very large, so you need to return a string instead of an integer.
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
**Example:** For **[-2,1,-3,4,-1,2,1,-5,4]**, the contiguous subarray **[4,-1,2,1]** has the largest sum, which is ***6***.
For this problem, return the maximum sum.
Given a collection of intervals, merge all overlapping intervals.
**Example:** Given **[1,3], [2,6], [8,10], [15,18]**, return ***[1,6] [8,10] [15,18]***.
**Note:** Make sure the returned intervals are sorted.
You are in an infinite 2D grid where you can move in any of the 8 directions :
(x,y) to
(x+1, y),
(x - 1, y),
(x, y+1),
(x, y-1),
(x-1, y-1),
(x+1,y+1),
(x-1,y+1),
(x+1,y-1)
You are given a sequence of points and the order in which you need to cover the points. Give the minimum number of steps in which you can achieve it. You start from the first point.
**Example:** For **[(0, 0), (1, 1), (1, 2)]**, return ***2***.
It takes 1 step to move from (0, 0) to (1, 1). It takes one more step to move from (1, 1) to (1, 2).
You are given a read only array of n integers from 1 to n. Each integer appears exactly once except A which appears twice and B which is missing. Return A and B.
**Note:** Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
**Note 2:** that in your output A should precede B.
**Example:** For ***[3, 1, 2, 5, 3]*** return ***[3, 4]***
Given an m x n matrix of 0s and 1s, if an element is 0, set its entire row and column to 0. Do it in place.
**Example:** For a given array A as **[ [1, 0 ,1], [1, 1, 1], [1, 1, 1,] ]**, on returning, the array A should be ***[ [0, 0 ,0], [1, 0, 1], [1, 0, 1] ]***
**Note:** Try to minimize the space and time complexity.
Rearrange a given array so that Arr[i] becomes Arr[Arr[i]] with O(1) extra space.
**Example:** For a given array Arr as **[1, 0]**, on returning, the array Arr should be ***[0, 1]***
**Note:** Lets say N = size of the array. Then, following holds true : * All elements in the array are in the range [0, N-1] * N * N does not overflow for a signed integer
Given a positive integer, return its corresponding column title as appear in an Excel sheet.
**Example:**
1 -> A
2 -> B
3 -> C
...
26 -> Z
27 -> AA
28 -> AB
Given a column title as appears in an Excel sheet, return its corresponding column number.
**Example:**
A -> 1
B -> 2
C -> 3
...
Z -> 26
AA -> 27
AB -> 28
Given a positive integer N, print all the integers from 1 to N. But for multiples of 3 print “Fizz” instead of the number and for the multiples of 5 print “Buzz”. Also for number which are multiple of 3 and 5, prints “FizzBuzz”.
**Example:** Given **N = 5** Return: ***[1 2 Fizz 4 Buzz]***
**Note:** Instead of printing the answer, you have to return it as list of strings.
Determine whether an integer is a palindrome. Do this without extra space.
A palindrome integer is an integer x for which reverse(x) = x where reverse(x) is x with its digit reversed. Negative numbers are not palindromic.
**Example:**
Input : **12121**
Output : ***True***
Input : **123**
Output : ***False***
Given a positive integer which fits in a 32 bit signed integer, find if it can be expressed as A^P where P > 1 and A > 0.
A and P both should be integers.
**Example:**
Input : **4**
Output : ***True***
as 2^2 = 4.
Given an even number ( greater than 2 ), return two prime numbers whose sum will be equal to given number.
**Example:**
Input : **4**
Output : ***2 + 2 = 4***
**Note:** If there are more than one solutions possible, return the lexicographically smaller solution.
If [a, b] is one solution with a <= b,
and [c,d] is another solution with c <= d, then
[a, b] < [c, d]
If a < c OR a==c AND b < d.
Given 2 non negative integers m and n, find gcd(m, n).
GCD of 2 integers m and n is defined as the greatest integer g such that g is a divisor of both m and n. Both m and n fit in a 32 bit signed integer.
**Example:**
Input : **m = 6, n = 9**
Output : ***GCD(m, n) = 3***
**Note:** DO NOT USE LIBRARY FUNCTIONS
Merge k sorted linked lists and return it as one sorted list.
**Example:**
**1 -> 10 -> 20
4 -> 11 -> 13
3 -> 8 -> 9**
will result in
***1 -> 3 -> 4 -> 8 -> 9 -> 10 -> 11 -> 13 -> 20***
NOTE: PRs and Stars are always welcome ✨