Leetcode

1642. Furthest Building You Can Reach

Understanding the Problem: Imagine traversing a series of buildings, each with its own height. We’re equipped with a limited supply of bricks and ladders, and our goal is to reach as far as possible while conserving resources. The furthest building problem challenges us to determine the maximum distance we can travel given the heights of…

Tech

Summary of all SSO Related Concepts

Single Sign-On (SSO) has revolutionized the way users authenticate and access applications in today’s digital landscape. By providing a seamless authentication experience and improving security, SSO has become a cornerstone of modern identity and access management (IAM) solutions. In this blog, we’ll delve into the core concepts of SSO, including its benefits, key components and…

Leetcode

56. Merge Intervals

Understanding the Problem Given a collection of intervals represented as an array of pairs [start, end], the task is to merge overlapping intervals and return a new array of non-overlapping intervals. Approach To merge intervals efficiently, we can follow these steps: Create a class Interval to represent each interval with start and end attributes. Implement…

Leetcode

1463. Cherry Pickup II

We are given a grid where each cell represents the number of cherries available. Two robots start at the top-left corner of the grid and must traverse down to the bottom-right corner. Each robot can move only in three directions: down, right, or diagonally down-right. However, the robots cannot occupy the same cell at the…

Leetcode

279. Perfect Squares

The Perfect Squares problem is a classic dynamic programming challenge where the goal is to find the minimum number of perfect square numbers (numbers that can be expressed as the square of an integer) that sum up to a given positive integer ‘n’. In this blog, we’ll explore the problem, understand its intuition, and implement…

Tech

451. Sort Characters By Frequency

Understanding the Problem: Given a string, our goal is to sort its characters based on their frequency. For example, for the input “tree,” the output should be “eert” or “eetr,” as both have the same characters but with different arrangements based on frequency. Approach: To tackle this problem, we’ll employ a HashMap to store each…

Leetcode

1695. Maximum Erasure Value

Understanding the Problem Given an array of integers nums, our task is to find the maximum sum of a contiguous subarray containing only unique elements. Approach We can solve this problem using a sliding window approach. We’ll maintain two pointers, start and end, to define the current subarray. Additionally, we’ll use a HashSet to keep…

Leetcode

49. Group Anagrams

Understanding the Problem Given an array of strings strs, our task is to group the strings that are anagrams of each other together and return them as a list of lists. Approach To efficiently group anagrams, we can leverage the properties of anagrams. Two strings are anagrams of each other if they have the same…

Pages