Count K-Subsequences of a String with Maximum Beauty Solution || Leetcode Bi-Weekly 112 Get link Facebook X Pinterest Email Other Apps - September 04, 2023 Count K-Subsequences of a String with Maximum Beauty Get link Facebook X Pinterest Email Other Apps
String Protocol Solution || Codechef Starters - 29 Get link Facebook X Pinterest Email Other Apps - March 09, 2022 String Protocol Solution Codechef Starters - 29Problem Code : STRPProblem Link : https://www.codechef.com/START29C/problems/STRPSolution :#include <bits/stdc++.h>#define ll long long int#define ull unsigned long long intusing namespace std;void solve(){ ll n; cin >> n; string s; cin >> s; ll ans = 0, i = 0; while (i < n) { if (s[i] == s[i + 1]) { ans++; i += 2; } else { ans++; i++; } } cout << ans << "\n";}int main(){ ll t; cin >> t; while (t--) { solve(); }} Get link Facebook X Pinterest Email Other Apps Comments
Exact Marks Solution || Codechef March Long Challenge 2022 - I - March 11, 2022 Exact Marks Solution Read more
Substring of a Substring Solution || Codechef March Long Challenge 2022 - I - March 11, 2022 Substring of a Substring Solution Read more
Binary Base Basics Solution || Codechef February Long Challenge 2022 - I - February 04, 2022 Binary Base Basics Solution Read more
Comments
Post a Comment