Sub characters of a String
CodeChefOpen on judge ↗
Description A Maths teacher usually solves tedious problems. One day she tries to solve problems based on strings. A string consist of n characters and its index starts from 0. She saw set of q queries based on the particular input string S. She needs the help to solve that particular problem. The query takes one of the following two forms 1 i j t where 1 represents the form. All letters in the
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start