Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input. Leetcode 56. Merge Intervals One of the medium-hard problems found on Leet Code is known as “Merge Intervals.” This challenge gives us a list of lists of …
“Design LRU cache” is a very typical interview problem asked in FAANG. This question shows the design capability of the candidate and how he selects the datatype while programming. Caches are an integral component of any computing system. These are tiny containers that store data fragments to make them accessible easily thus, reducing computing time. …
Leetcode 146. LRU Cache: Multiple Solutions in Python Code Read More »
Count good nodes in a binary tree, according to LeatCode this is Microsoft’s most asked interview question of 2021 so far. I think it’s a pretty good problem to understand. A lot of basic Tree fundamental knowledge can be gained from this problem. So we’re given the root of a binary tree that is going …
Leetcode: Count Good Nodes in Binary Tree in Python Read More »
Two Sum problem is considered easy and is frequently asked in Amazon phone interviews. We will see how we can start with a brute force solution and try to improve the code by introducing more data structures. Problem Statement: Given an array of integers nums and an integer target return indices of the two numbers …
Leetcode 1: Two Sum problem – Multiple Solutions in Python Read More »
