Round 1
Questions:
Question 1:


public static List<Integer> minimalOperations(List<String> words) { List<Integer> result = new ArrayList<>(); for (String word : words) { int changes = 0; char[] chars = word.toCharArray(); for (int i = 1; i < chars.length; i++) { if (chars[i] == chars[i - 1]) { changes++; chars[i] = 'X'; } } result.add(changes); } return result; }
Question 2:





public static int getMostVisited(int n, List<Integer> sprints) { int[] visitCount = new int[n + 2]; for (int i = 0; i < sprints.size() - 1; i++) { int start = Math.min(sprints.get(i), sprints.get(i + 1)); int stop = Math.max(sprints.get(i), sprints.get(i + 1)); visitCount[start]++; visitCount[stop + 1]--; } int maxVisits = 0; int mostVisitedMarker = 0; int currentVisits = 0; for (int i = 1; i <= n; i++) { currentVisits += visitCount[i]; if (currentVisits > maxVisits) { maxVisits = currentVisits; mostVisitedMarker = i; } } return mostVisitedMarker; }
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.