Print nodes at K distance from root in binary tree. ORPrint nodes at Level K.
Given a Binary Tree, Print all Nodes that are at K distance from root node in Binary Tree.
We can also think of this question as Print all nodes that belong to Level K.
...
Home
»
Archives for November 2016
Rotate matrix by 90 degree
in
Algorithm,
Datastructure,
Interviews,
Matrix
- on 21:04:00
- No comments

Rotate matrix by 90 degree OR Turn an 2D array by 90 degree OR
Rotate a two dimensional array OR
Given N*M matrix, rotate it by 90 degree to left and right.
Given N*M Matrix, Rotate it by 90 degrees.
Lets understand the problem statement graphically...
Rotate Matrix by 90 degrees clockwise Inplace
in
Algorithm,
Datastructure,
Interviews,
Matrix
- on 10:47:00
- No comments

Rotate square matrix by 90 degrees Inplace OR Turn an 2D array by 90 degree OR
Rotate a two dimensional array OR
Given N*N matrix, rotate it by 90 degree to left and right without extra memory
Rotate square matrix by 90 degrees Inplace.
Lets understand...
Print Matrix in Spiral order using Recursion.
in
Algorithm,
Datastructure,
Interviews,
Matrix,
Miscellaneous
- on 20:39:00
- No comments

Print Matrix in Spiral order OR Given m*n matrix(m rows, n columns), print all elements of the matrix in spiral order OR
Print two-dimensional array in spiral order OR
How to print elements of Matrix in Spiral Format?
Given a Matrix(2D array), print...
Print Matrix in Spiral form
in
Algorithm,
Datastructure,
Interviews,
Matrix
- on 10:44:00
- No comments

Print Matrix in Spiral order OR Given m*n matrix(m rows, n columns), print all elements of the matrix in spiral order OR
Print two-dimensional array in spiral order OR
How to print elements of Matrix in Spiral Format?
Given a Matrix(2D array), print...
Transpose of Matrix Inplace
in
Algorithm,
Datastructure,
Interviews,
Matrix
- on 03:46:00
- No comments

Transpose of Matrix In-place
You are given a M * N matrix, find Transpose of Matrix in-place.
Transpose of matrix is obtained by interchanging rows and columns of a matrix that is by changing rows to columns and columns to rows.
Lets understand...
Transpose of Matrix in Java
in
Algorithm,
Datastructure,
Interviews,
Matrix
- on 06:34:00
- No comments

Transpose of Matrix in Java
You are given a M * N matrix, find Transpose of Matrix.
Transpose of matrix is obtained by interchanging rows and columns of a matrix that is by changing rows to columns and columns to rows.
Lets understand the...
Implement Queue using One Stack in Java (Recursive Implementation)
in
Algorithm,
Datastructure,
Interviews,
Queue,
Stack
- on 11:41:00
- No comments

Implement Queue using One Stack in Java
You are given a Stack data structure that supports standard push and pop operations.
You need to implement Queue data structure using one Stack instances.
Lets understand the problem statement graphically...
Implement Queue using Stack
in
Algorithm,
Datastructure,
Interviews,
Queue,
Stack
- on 07:01:00
- No comments

Implement Queue using Stack in Java
You are given a Stack data structure that supports standard push and pop operations.
You need to implement Queue data structure using Stack instances.
Lets understand the problem statement graphically and it will...
Download binary file AngularJS + REST service
in
AngularJS,
Miscellaneous,
Web Service
- on 11:35:00
- No comments

Download binary file using AngularJS + REST service
Many
a times we need to download file via POST request, because the request
contains extra parameters to pass and GET request is not suitable.
Download file from server example...
Burning Rope Puzzle - Measure 45 Minutes
in
Interviews,
Puzzle
- on 05:35:00
- No comments

The Burning Rope Puzzle
You have 2 ropes. Each takes exactly 60 minutes to burn. They are made of different material so even though they take the same amount of time to burn, they burn at separate rates.
In addition, each rope burns inconsistently....
Implement Stack using One Queue
in
Algorithm,
Datastructure,
Interviews,
Java,
Queue,
Stack
- on 10:55:00
- No comments

Implement Stack using Single Queue in Java
You are given a Queue data structure that supports standard enQueue and deQueue operations.
You need to implement Stack data structure using Single Queue.
Lets understand the problem statement graphically...
Implement Stack using Queue
in
Algorithm,
Datastructure,
Interviews,
Java,
Queue,
Stack
- on 09:51:00
- No comments

Implement Stack using Queue in Java
You are given a Queue data structure that supports standard enQueue and deQueue operations.
You need to implement Stack data structure using Queue instances.
Lets understand the problem statement graphically...
Find Smallest and Second smallest element in array.
in
Algorithm,
Array,
Datastructure,
Interviews,
Java,
Miscellaneous
- on 20:33:00
- No comments

Find Smallest and Second smallest number in array.
Given a integer array, find smallest and second smallest number in array.
Lets understand the problem statement graphically and it will be more clear,
Find smallest and second smallest element in...
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
Given a integer array, find largest and second largest number in array.
Lets understand the problem statement graphically and it will be more clear,
Find the largest and second largest element in...
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. Lets understand the problem statement graphically and it will be...
Find Largest and Smallest number in Array
in
Array,
Interviews,
Java,
Miscellaneous
- on 04:07:00
- No comments

Find minimum and maximum number in array
Given a integer array, find minimum and maximum number in array.
Lets understand the problem statement graphically and it will be more clear,
Find minimum and maximum element in an array in Java...