Today, we are working on 253. Meeting Rooms II Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of conference rooms required.)

Today, we are working on 252. Meeting Rooms Given an array of meeting time intervals consisting of start and end times[[s1,e1],[s2,e2],...](si< ei), determine if a person could attend all meetings.

Today, we are working on 242. Valid Anagram Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters…

Today, we are working on 238. Product of Array Except Self Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in…

Today, we are working on 236. Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q…

Over the Christmas and New Year holidays, it’s expected to have many people traveling. Normally, this is the time for joy and happiness. We are supposed to enjoy our time off and be worry free. However, this year is a bit different. Storm Elliot has caused made traveling become chaotic…

Happy new year everyone! Hope you guys all have a good rest and enjoyed your holidays. Now that the calendar turned, let’s get back to business. Today, we are working on 235. Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowest common…