Capgemini coding

import java.util.Scanner;
public class MoveHash {
    public static String moveHash(String str) {
        StringBuilder hashes = new StringBuilder();
        StringBuilder letters = new StringBuilder();
        for (char c : str.toCharArray()) {
            if (c == '#') hashes.append(c);
            else letters.append(c);
        }
        return hashes.toString() + letters.toString();
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.nextLine();
        System.out.println(moveHash(str));
    }
}

#include <stdio.h>
#include <string.h>
void moveHash(char str[]) {
    int n = strlen(str);
    char result[1000];
    int idx = 0, hashCount = 0;
    for (int i = 0; i < n; i++) {
        if (str[i] == '#') hashCount++;
    }
    for (int i = 0; i < hashCount; i++) result[idx++] = '#';
    for (int i = 0; i < n; i++) {
        if (str[i] != '#') result[idx++] = str[i];
    }
    result[idx] = '\0';
    printf("%s\n", result);
}

int main() {
    char str[1000];
    scanf("%s", str);
    moveHash(str);
    return 0;
}

import java.util.Scanner;
public class StringCompression {
    public static String compress(String s) {
        StringBuilder result = new StringBuilder();
        int i = 0;
        while (i < s.length()) {
            char current = s.charAt(i);
            int count = 1;
            while (i + count < s.length() && s.charAt(i + count) == current) {
                count++;
            }
            result.append(current);
            if (count > 1) result.append(count);
            i += count;
        }
        return result.toString();
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        System.out.println(compress(s));
    }
}

#include <iostream>
#include <string>
using namespace std;

string compress(string s) {
    string result = "";
    int i = 0, n = s.length();
    while (i < n) {
        char current = s[i];
        int count = 1;
        while (i + count < n && s[i + count] == current) count++;
        result += current;
        if (count > 1) result += to_string(count);
        i += count;
    }
    return result;
}

int main() {
    string s;
    cin >> s;
    cout << compress(s) << endl;
    return 0;
}

public class SpiralTraversal {
    public static void printSpiral(int[][] matrix) {
        int top = 0, bottom = matrix.length - 1;
        int left = 0, right = matrix[0].length - 1;

        while (top <= bottom && left <= right) {
            for (int i = left; i <= right; i++) System.out.print(matrix[top][i] + " ");
            top++;
            for (int i = top; i <= bottom; i++) System.out.print(matrix[i][right] + " ");
            right--;
            if (top <= bottom) {
                for (int i = right; i >= left; i--) System.out.print(matrix[bottom][i] + " ");
                bottom--;
            }
            if (left <= right) {
                for (int i = bottom; i >= top; i--) System.out.print(matrix[i][left] + " ");
                left++;
            }
        }
    }
}

import java.util.*;
public class FrequencyCount {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) arr[i] = sc.nextInt();

        Map<Integer, Integer> freq = new LinkedHashMap<>();
        for (int num : arr) {
            freq.put(num, freq.getOrDefault(num, 0) + 1);
        }
        for (Map.Entry<Integer, Integer> entry : freq.entrySet()) {
            System.out.println(entry.getKey() + " occurs " + entry.getValue() + " times");
        }
    }
}

#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> arr(n);
    unordered_map<int, int> freq;
    vector<int> order;
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
        if (freq[arr[i]] == 0) order.push_back(arr[i]);
        freq[arr[i]]++;
    }
    for (int num : order) {
        cout << num << " occurs " << freq[num] << " times" << endl;
    }
    return 0;
}

import java.util.Scanner;
public class TyreCount {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            int cars = sc.nextInt();
            int bikes = sc.nextInt();
            System.out.println(cars * 4 + bikes * 2);
        }
    }
}

#include <iostream>
using namespace std;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int cars, bikes;
        cin >> cars >> bikes;
        cout << (cars * 4 + bikes * 2) << endl;
    }
    return 0;
}