In this tutorial, I am going to discuss a programming question Palindrome linked list and it’s implementation using java code.
Given a singly linked list, Write a code that returns true if the given linked list is a Palindrome else return false.
For example –
Example 1 –
1 -> 3 -> 4 -> 3 -> 1 -> NULL
It’s a palindrome.
Example 2 –
1 -> 3 -> 4 -> NULL
It’s not a palindrome.
NOTE: We have to solve this problem in O(n) time complexity and without using any extra space.
Minimum Size Subarray Sum (Smallest subarray whose sum is greater than or equal to target).
Given an array of positive integers and a positive number k. Find the smallest contiguous subarray whose sum is either greater than or equal to k. If no subarray is found then return 0.
For example –
Example 1 –
Input : {7, 2, 1, 1, 6, 5}, k = 11
Output: 2 ( subarray {6, 5} has the minimum length )
Example 2 –
Input : {1, 4, 3}, k = 12
Output: 0 (No subarray is possible)
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]]