TheJobOverflow

Request Recent Questions Now!

2 Votes | 3 Replies

Apollo on-campus IITs free-public-post coding-round

4 Votes | 5 Replies

free-public-post IITs coding-round saplabs on-campus

7 Votes | 3 Replies

on-campus IITs free-public-post edgeverve coding-round

6 Votes | 7 Replies

product free-public-post paytm OAs coding-round

3 Votes | 3 Replies

on-campus coding-round IITs juniper

3 Votes | 2 Replies

on-campus amazon coding-round IITs

0 Votes | 2 Replies

paypal coding-round product IITs

10 Votes | 3 Replies

on-campus IITs free-public-post BNY-Mellon coding-round

9 Votes | 4 Replies

on-campus free-public-post OA flipkart IIT

2 Votes | 2 Replies

free-public-post JP-Morgan jpmc coding-round on-campus

10 Votes | 7 Replies

free-public-post coding-round on-campus Zepto product

0 Votes | 4 Replies

product Confluent on-campus IITs

0 Votes | 1 Reply

cred product job free-public-post OAs

3 Votes | 2 Replies

free-public-post audify-tech coding-round on-campus product

9 Votes | 3 Replies

product on-campus IITs rubrik coding-round

6 Votes | 3 Replies

tiktok product free-public-post OAs coding-round

7 Votes | 2 Replies

hilabs product on-campus free-public-post

1 Vote | 3 Replies

product on-campus free-public-post jaguar coding-round

6 Votes | 4 Replies

free-public-post wells-fargo coding-round on-campus product

7 Votes | 4 Replies

product free-public-post sprinklr OAs coding-round

15 Votes | 3 Replies

product OAs codenation trilogy-innovations

5 Votes | 4 Replies

alphagrep on-campus product coding-round

0 Votes | 2 Replies

product on-campus IITs free-public-post intel

0 Votes | 2 Replies

product on-campus free-public-post hsbc coding-round

1 Vote | 3 Replies

paypal OAs coding-round

4 Votes | 4 Replies

free-public-post Jio product on-campus

2 Votes | 2 Replies

product on-campus Navi free-public-post coding-round

1 Vote | 2 Replies

intern walmart free-public-post coding-round

0 Votes | 2 Replies

coding-round standard-chartered on-campus

3 Votes | 3 Replies

standard-chartered on-campus coding-round

4 Votes | 6 Replies

free-public-post coding-round on-campus product mastercard

4 Votes | 2 Replies

product on-campus zomato free-public-post coding-round

12 Votes | 14 Replies

free-public-post Uber coding-round on-campus product

11 Votes | 3 Replies

free-public-post IIT coding-round on-campus sprinklr

3 Votes | 2 Replies

free-public-post OAs Relevel coding-round product

4 Votes | 4 Replies

product on-campus free-public-post uber

6 Votes | 3 Replies

product gameskraft IITs free-public-post OAs

15 Votes | 3 Replies

product on-campus free-public-post flipkart coding-round

13 Votes | 2 Replies

free-public-post job OAs uber product

8 Votes | 2 Replies

product Rubrik OAs free-public-post

966 results • Page 17 of 25

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

Comment: Goldman Sachs OA | Bird Singing | Number Factors and Permutations | Summer Analy by Vishal NA • 0

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

Answer: Goldman Sach Coding Round | SDE, London | 8th August 2020 by Vishal NA • 0

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

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

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

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

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

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

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

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

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

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0

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

Answer: Microsoft , Recent Online Assessment (18th August 2023) | Car Manufacturer | Li by Nitin Singh • 0

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

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by Pritam Kumar Choudhary • 0

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

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by a aryan • 20

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

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by a aryan • 20

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

Answer: Uber OA (on campus) | 6 Month Intern by Abhijit Mishra • 20

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

Answer: Barclays, Recent Online Assesment Questions | String Generation | Insurance (SQ by Alok kumar • 10

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

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Munnanur • 0

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

Answer: Question from my last OA, Infeneon by Vatsal Patel • 20

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…

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Answer: Nvidia, Recent Online Assessment Question | String Search | 2023

How to get Premium Access?

Answer: Uber OA (on campus) | 6 Month Intern

AlgoUniversity Technology Fellowship: Stage 2 || Important Questions

PhonePe | 9th October | Online Assessments

Answer: Question from my last OA, Infeneon

Answer: Question from my last OA, Infeneon

Answer: Juspay | 21st October | Online Assessments

Answer: Juspay | 21st October | Online Assessments

AlgoUniversity Technology Fellowship: Stage 2 || Important Questions

Recent Locations

Guwahati, 16 minutes ago

Roorkee, 19 minutes ago

Roorkee, 37 minutes ago

Varanasi, 52 minutes ago

India, 1 hour ago

Recent Awards • All

Great Question to John 1.0k

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to John 1.0k

Popular Question to pillaisamarth • 30