In this post, we are going to solve a problem merge overlapping intervals.
Given a list of time intervals. Each interval has a start and end time. Write a code to merge all overlapping intervals. The given intervals may or may not be sorted.
For example –
Example 1-
Input: [[1,4], [2,5], [6,9]] Output: [[1,5], [6,9]]
Example 2-
Input: [[7,8], [2,3], [5,9]] Output: [[2,3], [5,9]]
Example 3-
Input: [[1,4], [2,6], [3,5]] Output: [[1,6]]
Given a singly linked list, write a code to remove nth node from the end of a linked list. In this problem, you can assume the value of n is always valid.
For example –
In this example, the input linked list has four nodes and we have to remove 2nd node from the end.
Input –
15 -> 9 -> 8 -> 5 -> NULL , N = 2
After removing second node (node whose value is 8) from the end, the output is
15 -> 9 -> 5 -> NULL
In this tutorial, I am going to discuss a very interesting problem Product of array except self or product of every integer except the integer at that index.
Given an array of N integers where N > 1. Write a code to print the result/output such that result[i] is equal to the product of all the elements of an array except self (result[i]).
For example –
Input: {4, 2, 1, 7}
Output: {14, 28, 56, 8}
NOTE: We have to solve this problem without division and in linear time O(n).