Check 2 strings are anagrams of each other.
What is Anagram?
An anagram is a rearrangement of the letters of one word or phrase to another word or phrase, using all the original letters exactly once.
Example: 1. "evil" and "vile" is anagram...
Home
»
Archives for October 2015
Check If two strings are Anagrams.
in
Interviews,
Miscellaneous,
Strings
- on 03:35:00
- No comments
Find all subsets of a set (Power Set)
in
Algorithm,
Bit Manipulation,
Interviews,
Java
- on 13:26:00
- No comments

Print power set of any given set OR Print all subsets of a set OR Find all subsets of a set OR Print all subset of an array.
Given a set of numbers, print all the possible subsets of it including empty set.
What is Power Set?
In mathematics, the...
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord.
in
Algorithm,
Graph,
Miscellaneous
- on 21:53:00
- No comments

Word Ladder ( Doublets / Word-links / Word golf )
Given two words, startWord and endWord, and a dictionary, find the length of shortest transformation sequence from startWord to endWord.
Rules:
1. Only one letter can be changed at a time.
2. Each...
Print Nodes in Bottom View of Binary Tree.
in
Algorithm,
Binary Search Tree,
Binary Tree,
Datastructure
- on 05:30:00
- No comments

Print the bottom view of Binary Tree
Given a binary tree, print the nodes that is visible, when the tree is viewed from the bottom.
Let us first understand what we want to achieve? what is the input and what will be the expected output?
Bottom...
Print Nodes in Top View of Binary Tree
in
Algorithm,
Binary Search Tree,
Binary Tree,
Datastructure
- on 23:04:00
- No comments

Print the top view of Binary Tree
Given a binary tree, print the nodes that is visible, when the tree is viewed from the top.
Let us first understand what we want to achieve? what is the input and what will be the expected output?
Top view means,...
Print a Binary Tree in Vertical Order. Find Vertical Sum of given Binary Tree.
in
Algorithm,
Binary Search Tree,
Binary Tree,
Datastructure
- on 04:28:00
- 2 comments

Print Binary Tree in Vertical Order ORPrint the Binary Tree in Vertical Order Path ORVertical order traversal of a Binary Tree. Find Vertical Sum of given Binary Tree
Given a binary tree, print it vertically.
Let us first understand what we want...
What is Load factor and Rehashing in Hashmap?
in
Java
- on 03:11:00
- No comments

What is Load factor and Rehashing in Hashmap?
This is the famous interview question for experienced, So Let's see what it is all about.
Hashmap is very popular data structure and found useful for solving many problems due to O(1) time complexity...
How time complexity of Hashmap get() and put() operation is O(1)? Is it O(1) in any condition?
in
Java
- on 23:39:00
- No comments

How time complexity of Hashmap get() and put() operation is O(1)?
This is the famous interview question for the beginners as well as for experienced, So Let's see what it is all about.
Hashmap is very popular data structure and found useful for...
How Hashmap data structure works internally? How hashcode and equals method work in hashmap? Explain with real time example.
in
Java
- on 12:28:00
- No comments

Hashmap data structure works internally?How hashcode and equals method work in hashmap?
This is the famous interview question for the beginners as well as for experienced, So Let's see what it is all about.
Hashmap is very popular data structure...