Make String a Subsequence Using Cyclic Increments | Leetcode 2825

[@kingraj4797]

Well said sir, In one go I have solved this problem keep going with this brief explanation sir..

[@techdose4u]

Great 👍

[@vikasvoruganti7490]

class Solution { public: bool canMakeSubsequence(string str1, string str2) { int n1=str1.size(); int n2=str2.size(); int j=0; for(int i=0;i

[@mayukhbhowmik934]

I feel your this solution in little bit of overwhelming....I tried Simply over two pointer approach:class Solution { private: bool Check(char x, char y) { // Check if x matches y directly or can transform into y by incrementing return (x == y || (x + 1 - 'a') % 26 + 'a' == y); } public: bool canMakeSubsequence(string str1, string str2) { int first = 0, second = 0; // Edge Case: If str1 is shorter than str2, it's impossible if (str1.length() < str2.length()) return false; // Two-pointer technique while (first < str1.length() && second < str2.length()) { if (Check(str1[first], str2[second])) { first++; second++; } else { first++; } } // If we traversed all of str2, it's possible to form it return second == str2.length(); } };

[@sailendrachettri8521]

Thank you sir :)

[@techdose4u]

welcome :)

[@letsk9188]

Thanks ❤

[@techdose4u]

welcome :)

[@bharat_india12]

bool canMakeSubsequence(string str1, string str2) { if(str2.size()>str1.size()) return false; int i=0,j=0; while(i

[@Sen-d9d]

I solve the java code with your code is accepted but if we have to submit it shows run time error messge

[@techdose4u]

maybe try correcting using some dry run

[@yashbhoomkar5027]

the problem also states "use the operation at most once" how did you handle that statement in your solution??

[@techdose4u]

It doesnt matter for how many indices you do coz you can parrallely do every increment at once for only for 1 time :)