LEXORDER EDITORIAL

Problem Link

PREREQUISITES:
STRING COMPARISON

EXPLANATION
Given Two strings S1 and S2, we need to find out If S1 is lexicographically smaller than S2,
to check it we compare two strings and at each index of string, we check if(S1[indx]<=S2[indx])
else output ("No)
if the first ‘N’ characters of both strings match (Where N is the minimum of lengths of two strings)
then we need to check the lengths of strings, and the minimum length string is lexicologically smaller
Code Link: #include<bits/stdc++.h>using namespace std;void solve(){ string s1,s2 - Pastebin.com