How will you print bits of a number in Java? 04.Feb.2016 14:21 PM
below method prints bits of a number
Discuss internals of Hashmap data structure in Java 28.Feb.2016 23:03 PM
HashMap is hash table based implementation of Map Interface in Java Collections Framework. It usually acts like a bucketed hash table, where buckets are arranged by order of hashcode
What do you understand by Big O Notation? 03.Feb.2016 19:16 PM
Big O Notation is a mechanism used to measure the relative inefficiencies of Algorithms in terms of space and time. It makes us understand how execution time & memory requirements of an algorithm grow as a function of increasing input size. In this notation, O stands for the Order of magnitude.
How will you calculate factorial of a large number in Java? 02.Feb.2016 15:45 PM
Factorial of relatively large numbers can be calculated by storing the resultant in BigInteger
How to find if the Linked List contains any Cycle/Loop ? 02.Feb.2016 13:36 PM
This solution is “Floyd’s Cycle-Finding Algorithm” as published in “Non-deterministic Algorithms” by Robert W. Floyd in 1967. It is also called “The Tortoise and the Hare Algorithm”.
What is difference between HashMap, LinkedHashMap and TreeMap 28.Feb.2016 23:02 PM
All three classes (HashMap, TreeMap and LinkedHashMap) implements Map interface, and therefore represents mapping from unique key to values. But there are different usage scenarios for each of them
How would you count word occurrence in a very large file. How to keep track of top 10 occurring words? 28.Feb.2016 23:01 PM
Please note that there are limited number of natural language words available and all of them can be easily fit into today's computer RAM. For example oxford English dictionary contains total of around 0.6 million words.
Implement power function with O(log N) time complexity and O(1) space in Java 28.Feb.2016 23:00 PM
The following mathematical expression can help us writing a method similar to Math.pow(x, n) using squaring as a technique for achieving exponentiation. This technique greatly reduces the time complexity to O (log n) compared to normal way of multiplying the number n times.
Given a collection of 1 million integers, All ranging between 1 to 9, how would you sort them in Big O(n) time ? 03.Dec.2015 18:53 PM
This is a typical Integer Sorting problem with a constraint that the number range to sort is very limited in spite 1 million total entries. Integer Sorting with limited range is achieved efficiently with Bucket Sorting.