Roy

It's better if we don't know each other, things are beautiful that way...

यदा यदा हि धर्मस्य ग्लानिर्भवति भारत। अभ्युत्थानमधर्मस्य तदात्मानं सृजाम्यहम्

[Roy @RoY_015__]

GFG Day 417: Gas Station

Given two integer arrays gas[] denoted as the amount of gas present at each station and cost[] denoted as the cost of travelling to the next station. You have a car with an unlimited gas tank.

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

Day 427: Partition Labels

Given a string s. Return a list of integers representing the size of these parts.

#leetcode #400DaysOfCode #VIT

[Roy @RoY_015__]

GFG Day 416: Job Sequencing Problem

Given two arrays: deadline[], and profit[], which represent a set of jobs, where each job is associated with a deadline, and a profit.

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

Day 426: Apply Operations to Maximize Score

Given an array nums of n positive integers and an integer k. Return the maximum possible score after applying at most k operations.

#leetcode #400DaysOfCOde #VIT

[Roy @RoY_015__]

@ishubhamkp Cheers brotha

[Roy @RoY_015__]

GFG Day 414: Minimum Platforms

Given the arrival times arr[] and departure times dep[] of all trains that arrive at a railway station. Task is to find the minimum number of platforms required at the station to ensure no train is kept waiting.

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

GFG Day 415: Activity Selection

Given a set of activities, each with a start time and a finish time, represented by start[] and finish[]. Your task is to determine the maximum number of activities that a person can complete in a day.

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

Day 425: Maximum Number of Points From Grid Queries

Given an m x n integer matrix grid and an array queries of size k. Return the resulting array answer.

#leetcode #400DaysOfCode #VIT https://t.co/aExou04YmV

[Roy @RoY_015__]

Day 424: Minimum Index of a Valid Split

Given a 0-indexed integer array nums of length n with one dominant element. Return the minimum index of a valid split. If no valid split exists, return -1.

#leetcode #400DaysOfCode #VIT

[Roy @RoY_015__]

GFG Day 413: Word Break

Given a string s and a list dictionary[] of words. Your task is to determine whether the string s can be formed by concatenating one or more words from the dictionary[].

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

Day 423: Minimum Operations to Make a Uni-Value Grid

Given a 2D integer grid of size m x n and an integer x. Return the minimum number of operations to make the grid uni-value. If it is not possible, return -1.

#leetcode #400DaysOfCode #VIT

[Roy @RoY_015__]

GFG Day 412: Boolean Parenthesization

Given a boolean expression s. Count the number of ways we can parenthesize the expression so that the value of expression evaluates to true.

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

Day 422: Check if Grid can be Cut into Sections

Given an integer n representing the dimensions of an n x n grid, with the origin at the bottom-left corner of the grid. Return true if such cuts can be made; otherwise, return false.

#leetcode #400DaysOfCode #VIT

[Roy @RoY_015__]

GFG Day 411: Matrix Chain Multiplication

Given an array arr[] which represents the dimensions of a sequence of matrices where the ith matrix has the dimensions for i>=1, find the most efficient way to multiply these matrices together.

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

Day 421: Count Days Without Meetings

Given a positive integer days representing the total number of days an employee is available for work. Return the count of days when the employee is available for work but no meetings are scheduled.

#leetcode #400DaysOfCode #VIT

[Roy @RoY_015__]

GFG Day 408: Total Decoding Messages

Given a string digits. You have to determine the total number of ways that message can be decoded.

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

Day 418: Number of Ways to Arrive at Destination

Given an integer n. Return the number of ways you can arrive at your destination in the shortest amount of time. Since the answer may be large, return it modulo 109 + 7.

#leetcode #400DaysOfCode #VIT

[Roy @RoY_015__]

GFG Day 407: Stickler Thief II

Given an array arr[] which represents houses arranged in a circle, where each house has a certain value. A thief aims to maximize the total stolen value without robbing two adjacent houses.

#GeeksForGeeks #400DaysOfCode #VIT

[Roy @RoY_015__]

Day 417: Count the Number of Complete Components

Given an integer n. There is an undirected graph with n vertices, numbered from 0 to n - 1. Return the number of complete connected components of the graph.

#leetcode #400DaysOfCode #VIT

[Roy @RoY_015__]

GFG Day 406: Stock Buy and Sell – Max 2 Transactions Allowed

In daily share trading, a trader buys shares and sells them on the same day. If trader is allowed to make max 2 transactions in a day, find out the max profit that trader can make.

#GeeksForGeeks #400DaysOfCode #VIT