We earn our trophies in the practice, but we lift them up in the competition 🏆✨.

4. Group Anagrams: Make a map which will store frequencymap as key and an arraylist as value, the value of that arraylist will be anagrams. Iterate over each string and check whether its freqMap is already present or not

What do you want to know?.

3. Two Sum: Make a Hashmap, iterate over the array, if at any point we found an element = target - currElement, update the answer array and return it.

2. Valid Anagrams(Easy): Make a frequency map of first string, and while traversing the second string, if we found a new character strings are not anagrams, otherwise anagrams

1. Contains Duplicate(Easy): Easy question: Reduce the time complexity from O(n^2) to O(n) by using a set, which helps in fast lookup(O(1))

Let's start NeetCode 150 and see how far can we go:.

Why Are There So Many Databases? by Cai Parry-Jones

Using Pair in Java without JavaFX is so annoying :(.

When two people always agree, one of them is not necessary.

Always test your own code: Even the best chefs taste their dishes before serving :D.

Is RCB finally going to break the jinx?.

It it is not the years in one's life that matter, but the life in one's years.

The magic you are looking for, is in the work you are avoiding✨.

I just published Consistent Hashing (Part-3: Real world example)

RT @paraschopra:

I just published Consistent Hashing (Part-2: Intro)

A novel after soooo long :).(The pen is unrelated in the pic)

I just published Consistent Hashing(Part-1: Hashing)

I just published PUT vs PATCH in RESTful APIs

Chaos is a ladder!.

Overqualified for small talk