Full stack developer intern
https://in.linkedin.com/jobs/view/full-stack-developer-intern-at-multiplier-ai-4003361092

def solve(start, stop):
    def ss(num):
        num_str = str(num)
        for char in num_str:
            digit = int(char)
            if digit == 0 or num % digit != 0:
                return False
        return True
    total_sum = 0
    for num in range(start, stop + 1):
        if ss(num):
            total_sum += num
    return total_sum

Motorq ✅

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <climits>
using namespace std;
long long minTimeToEvent(int x, int z, int m, const vector<int>& friends) {
    long long minTime = LLONG_MAX; 

    for (int Y : friends) {
        long long time = abs(x - Y) + m + abs(Y - z);
        minTime = min(minTime, time);
    }

    return minTime;
}

Motorq ✅

#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
int maxValidLength(const vector<int>& flowers, int K) {
    unordered_map<int, int> count;
    int n = flowers.size();
    int maxLength = 0;
    int left = 0;
    int distinctCount = 0;

    for (int right = 0; right < n; ++right) {
        if (count[flowers[right]] == 0) {
            distinctCount++;
        }
        count[flowers[right]]++;
                while (distinctCount == K) {
            count[flowers[left]]--;
            if (count[flowers[left]] == 0) {
                distinctCount--;
            }
            left++;
        }
        
        maxLength = max(maxLength, right - left + 1);
    }
    
    return maxLength;
}

Gardener and the flowers ✅
Motorq

SELECT
    department_id AS department_id,
    ROUND(AVG(salary), 2) AS avg_salary,
    COUNT(employee_id) AS num_employees
FROM
    employees
GROUP BY
    department_id
ORDER BY
    avg_salary DESC,
    department_id ASC;

Motorq ✅

s = input()
l = len(s.replace(" ", ""))
print(l)

Deloitte ✅

This message made my Day ❤

void generateSubsequences(string s, string current, vector<string>& subsequences) {
    if (s.empty()) {
        if (!current.empty()) {
            subsequences.push_back(current);
        }
        return;
    }
    
    generateSubsequences(s.substr(1), current + s[0], subsequences);
    generateSubsequences(s.substr(1), current, subsequences);
}

vector<string> buildSubsequences(string s) {
    vector<string> subsequences;
    generateSubsequences(s, "", subsequences);
    sort(subsequences.begin(), subsequences.end());
    return subsequences;
}

Build the subsequence
ORACLE✅

from itertools import product
def goodOrBad(statementCounts, statements):
    n = len(statementCounts)
    max_good = 0
    for combination in product([True, False], repeat=n):
        is_valid = True
        good_count = sum(combination)
        for person, statement in statements:
            person -= 1 
            if combination[person]: 
                if not combination[statement - 1] == (statement == 1):  
                    is_valid = False
                    break
        
        if is_valid:
            max_good = max(max_good, good_count)
    return max_good

GOOD OR BAD✅
Oracle

#include <bits/stdc++.h>
using namespace std;

#define int long long

int solution(int n, vector<vector<int>>& edges) {
    vector<vector<int>> v(n + 1);
    vector<int> indegree(n + 1, 0);

    for (auto& edge : edges) {
        int u = edge[0], v1 = edge[1];
        v[u].push_back(v1);
        v[v1].push_back(u);
        indegree[v1]++;
        indegree[u]++;
    }

    vector<int> vis(n + 1, 0);
    queue<int> q;

    for (int i = 1; i <= n; i++) {
        if (indegree[i] == 1) {
            q.push(i);
            break;
        }
    }

    int c = 0;
    for (int i = 1; i <= n; i++) {
        if (indegree[i] == 0) {
            c++;
        }
    }

    if (q.empty()) {
        return -1;
    }

    while (!q.empty()) {
        int size = q.size();
        c++;
        for (int i = 0; i < size; i++) {
            auto node = q.front(); q.pop();
            if (vis[node]) continue;
            vis[node] = 1;

            for (auto x : v[node]) {
                if (!vis[x]) {
                    q.push(x);
                }
            }
        }
    }

    return c;
}
Cab Credit
Uber intern ✅

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int min_sum_time(vector<int>& time) {
    sort(time.begin(), time.end());
    int total_time = 0;
    int current_sum = 0;
    for (int t : time) {
        current_sum += t;
        total_time += current_sum;
    }
    return total_time;
}

Uber (intern) ✅
Sweets

#include <bits/stdc++.h>
using namespace std;

vector<vector<string>> solution(vector<string> apiList, vector<vector<long long>> rateLimits, vector<long long> defaultLimits, vector<vector<string>> requests) {
    
    struct RateLimit {
        long long limit;
        long long interval;
    };
    
    struct Request {
        string type;
        long long timestamp;
    };
    
    unordered_map<string, RateLimit> apiRateMap;
    for (size_t i = 0; i < apiList.size(); ++i) {
        apiRateMap[apiList[i]] = {rateLimits[i][0], rateLimits[i][1]};
    }


    unordered_map<string, queue<long long>> apiReqMap;
    unordered_map<string, long long> denied;

    for (const auto& req : requests) {
        string api = req[0];
        long long timestamp = stoll(req[1]);

        RateLimit rl = (apiRateMap.find(api) != apiRateMap.end()) ? apiRateMap[api] : RateLimit{defaultLimits[0], defaultLimits[1]};

        auto& q = apiReqMap[api];
        
        while (!q.empty() && q.front() <= timestamp - rl.interval) {
            q.pop();
        }

        if (q.size() < rl.limit) {
            q.push(timestamp);
        } else {
            denied[api]++;
        }
    }

    vector<vector<string>> result;
    for (const auto& entry : denied) {
        result.push_back({entry.first, to_string(entry.second)});
    }

    sort(result.begin(), result.end());
    
    return result;
}

Uber (intern) ✅