## [Complete] System Design Roadmap with Videos for SDEs

This is a definitive roadmap of system design for software engineers with no prior experience on the subject. If you

## Strivers 79 Last Moment DSA Sheet – Ace Interviews

Striver 79 Sheet Overview The Striver’s 79 Sheet contains very handily crafted and picked top coding interview questions from different

## Ceil in a Binary Search Tree

Problem Statement: Given a BST and a number X, find the Ceil of X.Note: Ceil(X) is a number that is

## Floor in a Binary Search Tree

Problem Statement: Given a BST and a number X, find the Floor of X.Note: Floor(X) is a number that is

## Find the row with maximum number of 1’s

Problem Statement: You have been given a non-empty grid ‘mat’ with ‘n’ rows and ‘m’ columns consisting of only 0s

## Search in a row and column-wise sorted matrix

Problem Statement: You have been given a 2-D array ‘mat’ of size ‘N x M’ where ‘N’ and ‘M’ denote

## Introduction to Binary Search Trees

Pre-requisite: Please watch the Binary Trees from this playlist first and then move on to understanding Binary Search Trees. Binary

## Minimise Maximum Distance between Gas Stations

Problem Statement: You are given a sorted array ‘arr’ of length ‘n’, which contains positive integer positions of ‘n’ gas