Count zeros in a row wise and column wise sorted matrix

Count zeros in sorted matrix

---

Count zeros in a row wise and column wise sorted matrix Lets understand the problem statement graphically and it will be more clear,

Search in a row wise and column wise sorted matrix

Find number in sorted matrix

---

Given an n x n matrix, where every row and column is sorted in increasing order.  Given a number k, how to decide whether this k is in the matrix. OR Search number in a row wise and column wise sorted matrix.

Lets understand the problem statement graphically and it will be more clear,

Find middle element of a linked list

Find middle element of a linked list in Java

---

Given a singly linked list find middle of the linked list.

Find Nth node from last in a linked list

Lets understand the problem statement graphically and it will be more clear,

Convert Sorted Linked List to balanced BST

Convert Sorted Linked list to balanced Binary Search Tree

---

Convert sorted list to binary search tree

Lets simplify the question statement, Given a singly Linked List where elements are sorted in  ascending order convert it to a height balanced BST.

A Binary Search Tree is called balanced if the height of left subtree and height of right subtree of Root differ by at most 1.

Lets understand the problem statement graphically and it will be more clear,

Sorted Array to Balanced Binary Search Tree (BST)

Convert Sorted Array to Balanced Binary Search Tree

---

Given a sorted array, create a Balanced Binary Search Tree using array elements. A Binary Search Tree is called Balanced if, the height of left subtree and height of right subtree of Root differ by at most 1.

Lets understand the problem statement graphically and it will be more clear,

Union and Intersection of Two Sorted Arrays

Union and Intersection of Two Sorted arrays

---

Given two sorted arrays of any length, Find Union and Intersection of given arrays.

Lets understand the problem statement graphically and it will be more clear,

Union and Intersection of two arrays in Java 

Merge two sorted arrays in Java

Merge two sorted arrays Java 

---

Merge two sorted arrays in java.
Lets simplify problem statement, given two sorted arrays, you need to merge it in one array such that merged array should also be sorted. 
 
Lets understand the problem statement graphically and it will be more clear,

Merge two sorted arrays in Java 

Clone linked list with next and random pointer

Clone linked list with next and random pointer

---

You are given a Doubly Link List with one pointer of each node pointing to the next node just like in a singly link list. The second pointer however can point to any node in the list and not just the previous node.
 
Lets understand the problem statement graphically and it will be more clear,

Clone Linked list in Java

Copy linked list in Java

---

Given a Linked list, Create a deep copy of Linked list.

Lets understand the problem statement graphically and it will be more clear,

Serialize and Deserialize a Binary Tree

Serialize and Deserialize a Binary Tree

---

Design an algorithm to serialize and deserialize given Binary Tree.  Serialization is to store tree in a File/String, so that it can be later restored. 
Deserialization is reading tree back from file.

Lets understand the problem statement graphically and it will be more clear,

We need to Serialize given Binary Tree into String(So that we can write it to File or transfer it). 

Also, we need to read the Serialized String and Deserialize it back to original Binary Tree.

Trapping Rain Water between Towers

How Much Water Can A Bar Graph Hold 

---

Given an bar graph, encoded as an array of non-negative integers, calculate the units of water that this bar graph can hold.

Let us put in technical terms,
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. Lets understand the problem statement graphically and it will be more clear,

Case 1:
Input     = [2, 0, 2]
Output  = 2


Case 2:
Input     = [3, 0, 0, 2, 0, 4]
Output  = 10

Case 3:
Input     = [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]
Output  =  6