In this video we will talk about how to use LeetCode Effectively.

Given an array of meeting time intervals where intervals[i] = [starti, endi], determine if a person could attend all meetings.

First we need to make sure the input, the given arguments for our function, that is two binary trees. And the output is a merged tree.

Today I am going to show how to solve the Leetcode Roman to Integer algorithm problem.

This post will introduce one specific application of Binary Search, i.e., when you are asked to find the upper or lower bound, or more precisely, when you need to find the maximum of the smallest value or the minimum of the largest value.

For our last ‘She’s coding’ data structure and algorithm practice event, we chose to solve maximum depth of N-ary tree problem(link). We had interesting discussion about approaches to solve it. In the following blog, I’ll share the common solution to this problem.

For my last technical interview, I was asked about how to trap rainwater. (Not really 🤪). It was a hard level Leetcode problem. I found it challenging, that’s why I’d like to write a blog about it. To make sure I understand the approach to solve similar problems in the future.

Ability to register and sign in to the application. Present the problem (questions) Provide an interface for the end-users to write, compile and execute code.

Number of Recent Calls is one of the leetcode questions that tripped us up. (As you can see how many downvotes it has.🧐) In the following blog, I’ll try to explain the problem and the example line by line to make it easier to understand.

They are so magnificent, in fact, that many people today still believe that they were built by the aliens. So, today we are going to build them in code with recursion.

In this video we will learn two different solutions to solve the power of four Leetcode problem

Imagine you have a bag of coins where each coin is of value 5 dollars and you have to find the total amount of money available in that bag, What would you do to find the total amount in the bag?

Subsequences have always been a concept that trips me up a bit. I don’t know why. But as with anything, the more time I spend working with subsequences, the more I slowly learn and get more comfortable with them

Love them or hate them, coding interviews are often a necessary part of getting a software engineering job. The format used to be writing solutions to algorithmic problems on a whiteboard.

A few days ago I bumped into a question on LeetCode where I saw a bunch of people scratching their heads. It was question number 10 titled Regular Expression Matching.

I’m writing this article because I never want to have someone put in 100s of hours into Leetcode and have them get this false sense of confidence that they can pass any coding interview.

In this Leetcode problem, we have to merge two sorted arrays into one.

CASE 012: Flattening The Matrix

A Step-by-Step Guide with Code Walk Through In this Leetcode problem, we’re told that we’re given an ordered array of positive integers that has some missing numbers as input, along with a number (k). Our task: find the kth missing number in that input array. Sounds more complicated than it is. Let’s get at it.

Once in a while, I come across an extraordinary programmer or software engineer. When that happens, my first instinct is to observe the way they work and carry themselves. Here are some things I have noticed that many successful software engineers do.