#python

Read more stories on Hashnode

Articles with this tag

Method to determine complexity from the Recursion Tree Let us take an example recursion tree, C being the function called recursively, T(1) as base...

Tag: Leetcode Hard Edit Distance Edit distance between two words is the minimum number of operations , i.e character insertions, deletions or...

Previously, in the blogs, problem solving has involved implementing what is obvious from the problem description and then optimizing the solution...

This is follow up from the previous blog. I will highly suggest you give it a read before proceeding. Recap Maximum Gap Given an integer array nums,...

Maximum Gap is a leetcode hard problem. Given an integer array nums, return the maximum difference between two successive elements in its sorted...

From a stream of events, return a random element. The class definition is class StreamObserber() def observer(x): def sample(): # return an...