Partitioning Into Minimum Number Of Deci-Binary Numbers (Leetcode 1689)

Difficulty: Medium Link: Day 26, May Leetcode Challenge Problem Description A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For…

Evaluate Reverse Polish Notation (Leetcode 150)

Difficulty: Medium Link: Day 25: May Leetcode Challenge Problem Description Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, and /. Each…

Find and Replace Pattern (Leetcode 890)

Difficulty: Medium Link: Day 21: May Leetcode Challenge Problem Description Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the…

Minimum Moves to Equal Array Elements II (Leetcode 462)

Difficulty: Medium Link: Day 19:May Leetcode Challenge Problem Description Given an integer array nums of size n, return the minimum number of moves required to make all array elements…

Find Duplicate File in System (Leetcode 609)

Difficulty: Medium Link: Day 18: May Leetcode Challenge Problem Description Given a list paths of directory info, including the directory path, and all the files with contents…

Longest String Chain (Leetcode 1048)

Difficulty: Medium Link: Day 17: May Leetcode Challenge Problem Description Given a list of words, each word consists of English lowercase letters. Let’s say word1 is a…

Valid Number (Leetcode 65)

Difficulty: Hard Link : Day 15: May Leetcode Challenge Asked in : Facebook, Linkedin, Twitch Problem Description A valid number can be split up into these components…

Flatten Binary Tree to Linked List (Leetcode 114)

Difficulty: Medium Link: Day 14: May Leetcode Challenge Problem Description Given the root of a binary tree, flatten the tree into a “linked list”: The “linked list”…

Ambiguous Coordinates (Leetcode 816)

Difficulty: Medium Link: Day 13: May Leetcode Challenge Problem Description We had some 2-dimensional coordinates, like “(1, 3)” or “(2, 0.5)”.  Then, we removed all commas, decimal points, and…

Interval List Intersections (Leetcode 986)

Difficulty: Medium Link: Leetcode 986 Problem Statement You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of…