Annamariya Tharayil

Jan 27

All Elements in Two Binary Search Trees — Day 108(Python)

Today’s question is from the daily leetcode challenge. Let us look into the problem statement. 1305. All Elements in Two Binary Search Trees Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order. Example 1:

Python 3

3 min read

All Elements in Two Binary Search Trees — Day 108(Python)

Jan 26

Remove Nth Node From End of List — Day 107(Python)

Today we will be working on the LinkedList problem. Let’s look into the problem statement. 19. Remove Nth Node From End of List Given the head of a linked list, remove the nth node from the end of the list and return its head. Example 1:

Python 3

3 min read

Remove Nth Node From End of List — Day 107(Python)

Jan 25

Koko Eating Bananas — Day 106(Python)

Today’s question is a medium-tagged question. Let’s look into the problem statement. 875. Koko Eating Bananas Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. Koko can decide her bananas-per-hour eating…

Python 3

3 min read

Jan 19

Search in a Sorted Array of Unknown Size — Day 105(Python)

Today’s question is a medium-tagged question. Let’s go! 702. Search in a Sorted Array of Unknown Size This is an interactive problem. You have a sorted array of unique elements and an unknown size. You do not have an access to the array but you can use the ArrayReader interface…

Binary Search

3 min read

Search in a Sorted Array of Unknown Size — Day 105(Python)

Jan 18

Lowest Common Ancestor of a Binary Tree — Day 104(Python)

Today we will be looking at a tree problem. It is a variation of the lowest common ancestor tree problem that we solved sometime back. The link to that problem can be found here. Let us look into today’s problem and how it is different from the previous question. 1644…

Python 3

3 min read

Lowest Common Ancestor of a Binary Tree — Day 104(Python)

Jan 13

Build Array from Permutation — Day 103(Python)

Today, we will look into another easy problem. 1920. Build Array from Permutation Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. A zero-based permutation nums is an array of distinct…

Python 3

2 min read

Build Array from Permutation — Day 103(Python)

Jan 11

Find the Highest Altitude — Day 102(Python)

We will work on another Easy tagged question from leetcode today. 1732. Find the Highest Altitude There is a biker going on a road trip. The road trip consists of n + 1 points at different altitudes. The biker starts his trip on point 0 with an altitude equal to…

Python

2 min read

Jan 11

Number of Good Pairs — Day 101(Python)

After a long hiatus, I decided to start writing again as a new year resolution. I wanted to start with something easy, hence choosing the following problem. 1512. Number of Good Pairs Given an array of integers nums, return the number of good pairs. A pair (i, j) is called good if nums[i] == nums[j]…

Python

2 min read

Mar 20, 2021

Keys and Rooms — Day 100 (Python)

Today’s question is from Daily Leetcode Coding Challenge — March Edition. It is a medium-tagged question. Let us look into the problem statement. 841. Keys and Rooms There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, ..., …

Python

3 min read

Mar 18, 2021

Delete Duplicate Emails — Day 99(SQL)

Today’s question is a SQL question. Let us look into the problem statement. 196. Delete Duplicate Emails Write a SQL query to delete all duplicate email entries in a table named Person, keeping only unique emails based on its smallest Id. +----+------------------+ | Id | Email…

Sql

1 min read