๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.62K subscribers
5.6K photos
3 videos
95 files
10.3K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
#include <iostream>
#include <vector>
using namespace std;
int main() {
    int n;
    cin >> n; 
    vector<int> arr(n);
        for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    for (int i = 0; i < n; ++i) {
        if (arr[i] % 2 != 0) {
            cout << arr[i] << " ";
        }
    }

    return 0;
}


Deloitte โœ…
๐Ÿ‘1
#include <iostream>
#include <sstream>
using namespace std;
int main() {
    string S;
    getline(cin, S);
    stringstream ss(S);
    string word;
    string result = "";
    while (ss >> word) {
        result += to_string(word.length());
    }
    cout << result << endl;
    return 0;
}


Deloitte โœ…
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MOD = 1000000007;
int countNewArrays(vector<int>& arr) {
    int n = arr.size();
        sort(arr.begin(), arr.end());
    long long result = 1;
    for (int i = 0; i < n; ++i) {
        int a = arr[i] - i;
                if (a <= 0) {
            return 0;
                }
        result = (result * possaible_values) % MOD;
    }
   
    return result;
}

DE SHAW โœ…
๐Ÿ‘1