Home »
All posts
Implement Stack using Queue
in
Algorithm,
Datastructure,
Interviews,
Java,
Queue,
Stack
- on 09:51:00
- No comments
Find Smallest and Second smallest element in array.
in
Algorithm,
Array,
Datastructure,
Interviews,
Java,
Miscellaneous
- on 20:33:00
- No comments
Find Largest and Second Largest number in array
in
Algorithm,
Array,
Datastructure,
Interviews,
Java
- on 19:49:00
- No comments
Find Largest and Second Largest number in array and Find Smallest and Second Smallest number in array
in
Array,
Interviews,
Java,
Miscellaneous
- on 23:05:00
- No comments
Find Largest and Second Largest number in array OR Find the smallest and second smallest element in array.
Given a integer array, find largest and second largest number in array.
Given a integer array, find largest and second largest number in array.
Find Largest and Smallest number in Array
in
Array,
Interviews,
Java,
Miscellaneous
- on 04:07:00
- No comments
Count zeros in a row wise and column wise sorted matrix
in
Algorithm,
Datastructure,
Interviews,
Matrix
- on 12:14:00
- No comments
Search in a row wise and column wise sorted matrix
in
Interviews,
Java,
Matrix,
Miscellaneous
- on 12:02:00
- No comments
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,
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
in
Algorithm,
Datastructure,
Interviews,
Linked List
- on 05:33:00
- No comments
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,
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
in
Algorithm,
Binary Search Tree,
Binary Tree,
Datastructure,
Interviews,
Linked List
- on 10:03:00
- No comments
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,
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)
in
Binary Search Tree,
Binary Tree,
Interviews
- on 03:47:00
- No comments
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,
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,













