Скачать или смотреть Easy task | GFG | POTD | 27th April 2023 | Arrays | Java | C++ | Problem Of The Day

The video solves Problem Of The Day question " Easy Task " asked on GeeksForGeeks on 27th April 2023 .

The problem requires us to perform two types of queries on a string: one that involves changing a character at a given index in the string, and the other that involves finding the k-th lexicographically largest character in a given substring of the string. We need to perform the queries in the order they appear in the input and return the answers to the type 2 queries in the same order.

To solve this problem, we can iterate over the queries array and perform the corresponding operations based on the type of query. For each type 1 query, we can simply update the character at the given index in the string. For each type 2 query, we can extract the given substring from the string, sort it in lexicographic order, and return the k-th largest character in the sorted substring.

GFG POTD 27th April 2023 :
https://practice.geeksforgeeks.org/pr...

Java | C++ solution Code Link :
https://docs.google.com/document/d/1k...

Java Interview Series :
   • Core Java Interview Questions  

GFG POTD series :    • Problem Of The Day | 31st Jan 2023 | Geeks...  

Java -17 series :    • Java 17 - Introduction