CODING
SYSTEM DESIGN
PLACEMENT PREP.
BLOG
LOGIN/REGISTER
MY ACCOUNT
LOGOUT
Maximum consecutive integers present in an array
Given an array of integers. Find the maximum number of consecutive integers present in the array. For example, if the array is: int arr[] =
[…]
HashMap performance improvement in Java 8
What improvement has java-8 made that performance of HashMap.get() function call is fast by 20% in Java-8.
Separate Chaining: Hashing collision handling technique
It is almost impossible to design a generic hash system without collision. In case of collision, it need to be handled. There are multiple ways
[…]
Hashing introduction
Let us design a data structure in which we want to store numbers (taking it for simplicity, else it can be anything). We want to
[…]
Check if two strings are anagrams
An anagram is a word play. If letters of a word can be arranged to form another word, the two words are called anagrams. e.g
[…]
