Given two linked lists, we have to find their intersection point.
Given an array, find triplets whose sum equals the given number.
For Example -
Find if there exists 3 numbers in the given array whose sum equals the given sum.
Array = {2, 7, 4, -1, 3} and sum = 6.
Output : 4, -1, 3
Since 4 + (-1) + 3 = 6
Given a binary tree, make it right skewed.
Round 2 :
Given an array, arrange it in an zig-zag manner.
For Example -
