Freaks City

Given a string s consisting exclusively of the characters 'a' and 'b', the objective is to determine the minimum number of steps required to make the string empty. In each operation, you are allowed to delete a palindromic subsequence from s. A subsequence is defined as a sequence that can be derived from another sequence by deleting zero or m ...

Longest Common PrefixApproach 1: Pairwise Comparison - Time Complexity O(m*n)class CommonPrefixFinder { public: string findLongestCommonPrefix(vector<string>& words) { // Pairwise comparison string result = words[0]; size_t count = words.size(); for(size_t i = 0; i < count; ++i) result = find ...

Minimum Insertions to Balance Parentheses Validating and repairing parenthesis strings requires tracking the relationship between opening and closing symbols. The algorithm monitors the current balance of unmatched left parentheses while counting necessary insertions. As we traverse the string, left parentheses increment a balance counter, whil ...

For Loops The for loop syntax in C mirrors that of JavaScript: for (initialization; condition; increment/decrement) { // loop body } Arrays Time Complexity Operation Average Case Worst Case Acess O(1) O(1) Search O(n) O(n) Insert O(n) O(n) Delete O(n) O(n) Multidimensional Arrays C++ stores multidimensional arrays as a cont ...

Problem 2810 - Faulty Keeyboard Simulate the keyboard behavior as described. When encuontering character 'i', reverse the current string. class Solution { public: string finalString(string input) { string result = ""; for(char c : input) { if(c == 'i') { reverse(result.begin(), ...

Intersection Calculation Given two line segments [L1, R1] and [L2, R2], determine their overlapping length. A simple approach uses a frequency array to mark covered positions. #include <iostream> using namespace std; int main() { int L1, R1, L2, R2; int coverage[101] = {0}, overlap = 0; cin >> L1 >> R1 >> L2 ...

Problem A: Digit Frequency Analysis Given a functon (f(x)) that counts the frequency of the most common digit in number (x), compute (\sum_{i=l}^{r}f(i)) for large ranges (up to (10^{18})). Approach: Represent digit counts as a state vector (S = {c_0, \dots, c_9}) Transform into frequency-of-counts representation (S' = {a_0, \dots, a_{18}}) Us ...

Problem 1: Character Output Output each character of the string "I Love GPLT" on a separate line. #include <iostream> using namespace std; int main() { string msg = "I Love GPLT"; for (char c : msg) { cout << c << '\n'; } return 0; } Problem 2: Standard Weight Calculation Given a ...

Binary search extends far beyond locating values in sorted arrays. The core requirement for applying this technique is identifying a monotonic relationship between an independent variable and a computed result. When a problem can be modeled as finding an input x such that a monotonic function f(x) equals a specific target, binary search becomes ...

Swappnig Adjacent Nodes in Pairs Given a linked list, swap every two adjacent nodes and return the head pointer. Only pointer manipulation is allowed; nodde values must remain unchanged. A sentinel node simplifies boundary handling. Maintain a prev pointer positioned immediately before each pair. In every iteration, identify the first node, the ...