๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.55K photos
3 videos
95 files
9.64K 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
def canonical_form(s):
    mapping = {}
    form = []
    next_index = 0

    for char in s:
        if char not in mapping:
            mapping[char] = next_index
            next_index += 1
        form.append(mapping[char])

    return tuple(form)

def solve(N, Q, S, K):
    canonical_map = {}

    for string in S:
        form = canonical_form(string)
        if form not in canonical_map:
            canonical_map[form] = 0
        canonical_map[form] += 1

    result = []
    for query in K:
        query_form = canonical_form(query)
        result.append(canonical_map.get(query_form, 0))

    return result

Google โœ…
#include <vector>
using namespace std;

vector<int> solution(vector<int> forest, int bird) {
    vector<int> pos;
    int total_length = 0;
    int direction = 1;
    int n = forest.size();
    while (total_length < 100) {
        if (direction == 1) {
            for (int i = bird + 1; i < n; i++) {
                if (forest[i] > 0) {
                    pos.push_back(i);
                    total_length += forest[i];
                    forest[i] = 0;
                    break;
                }
            }
        } else {
            for (int i = bird - 1; i >= 0; i--) {
                if (forest[i] > 0) {
                    pos.push_back(i);
                    total_length += forest[i];
                    forest[i] = 0;
                    break;
                }
            }
        }
        direction *= -1;
    }
    return pos;
}


Visa โœ