BFS of graph
Given a connected undirected graph containing V vertices, represented by a 2-d adjacency list adj[][], where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First […]
2873. Maximum Value of an Ordered Triplet I
You are given a 0-indexed integer array nums. Return the maximum value over all triplets of indices (i, j, k) such that i < j < k.
DFS of Graph
Given a connected undirected graph represented by a 2-d adjacency list adj[][], where each adj[i] represents the list of vertices connected to vertex i. Perform a Depth First
2140. Solving Questions With Brainpower
You are given a 0-indexed 2D integer array questions where questions[i] = [pointsi, brainpoweri]. The array describes the questions of an exam, where you have
Maximize partitions in a String
Given a string s of lowercase English alphabets, your task is to return the maximum number of substrings formed, after possible partitions (probably zero) of s such that no
2551. Put Marbles in Bags
You have k bags. You are given a 0-indexed integer array weights where weights[i] is the weight of the ith marble. You are also given the integer k. Divide the marbles
763. Partition Labels
You are given a string s. We want to partition the string into as many parts as possible so that each
Gas Station
There are some gas stations along a circular route. You are given two integer arrays gas[] denoted as the amount of gas present
2033. Minimum Operations to Make a Uni-Value Grid
You are given a 2D integer grid of size m x n and an integer x. In one operation, you can add x to or subtract x from any element in
Word Break
You are given a string s and a list dictionary[] of words. Your task is to determine whether the string s can be formed by concatenating
3169. Count Days Without Meetings
You are given a positive integer days representing the total number of days an employee is available for work (starting from day
Matrix Chain Multiplication
Given an array arr[] which represents the dimensions of a sequence of matrices where the ith matrix has the dimensions (arr[i-1] x arr[i]) for i>=1, find the most efficient way to