Minimum Moves to Convert String
As a Systems Engineer at Tata Consultancy Services, I deliver exceptional software products for mobile and web platforms, using agile methodologies and robust quality maintenance. I am experienced in performance testing, automation testing, API testing, and manual testing, with various tools and technologies such as Jmeter, Azure LoadTest, Selenium, Java, OOPS, Maven, TestNG, and Postman.
I have successfully developed and executed detailed test plans, test cases, and scripts for Android and web applications, ensuring high-quality standards and user satisfaction. I have also demonstrated my proficiency in manual REST API testing with Postman, as well as in end-to-end performance and automation testing using Jmeter and selenium with Java, TestNG and Maven. Additionally, I have utilized Azure DevOps for bug tracking and issue management.
You are given a string s consisting of n characters which are either 'X' or 'O'.
A move is defined as selecting three consecutive characters of s and converting them to 'O'. Note that if a move is applied to the character 'O', it will stay the same.
Return the minimum number of moves required so that all the characters of s are converted to 'O'.
LeetCode Problem - 2027
class Solution {
// Method to calculate the minimum number of moves to remove all 'X' characters in the string
public int minimumMoves(String s) {
// Initialize a counter to keep track of the number of moves
int count = 0;
// Iterate through the string 's'
for (int i = 0; i < s.length(); i++) {
// If the current character is not 'O' (i.e., it is 'X')
if (s.charAt(i) != 'O') {
// Increment the move counter
count++;
// Skip the next two characters as we can flip up to 3 consecutive 'X' at once
i = i + 2;
}
}
// Return the total number of moves required
return count;
}
}
