TheJobOverflow

Showing : hrt • reset

1 Vote | 1 Reply

1 result • Page 1 of 1

Filter Posts by Company

Recent Replies

// Solution for first problem #include<bits/stdc++.h> using namespace std; using ll = long long; const int mod = 7 * 24 * 60…

for question 11 correct answer is C option [x+(n-1)y]*(x-y)^n-1

K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number …

Write coad K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minim…

K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number of roads) …

K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number of roads) …

K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number of roads) from…

```#include <bits/stdc++.h> using namespace std; #define ll long long vector<int>par(26,-1); int find(int u){ …

#include<bits/stdc++.h> using namespace std; #define ll long long #define fastio ios_base::sync_with_stdio(false), cin.tie(nullp…

unequal elements (tle on larger test cases) 3D dp approach #include <bits/stdc++.h> using namespace std; …

Infection Sequences #include <bits/stdc++.h> using namespace std; const int MOD = 1e9+7; long long factorial(int …

3. #include <iostream> #include <vector> void solve() { long long n, m, k; long long x1, y…

#include<bits/stdc++.h> using namespace std; string findNewString(string &s1,string &s2) { …

n = 6 arr = 10 2 14 4 7 6 k = 3 x = 5

Solution Okay, the given example seems to be missing value 2. But if we join the pieces, the grid should look something like this/ 3…