TheJobOverflow

Request Recent Questions Now!

0 Votes | 0 Replies

curefit free-public-post on-campus

2.2 years ago

Delta 3.0k

0 Votes | 0 Replies

KLA-India free-public-post

2.2 years ago

Delta 3.0k

10 Votes | 12 Replies

free-public-post coding-round Accenture

9 Votes | 4 Replies

on-campus coding-round oracle free-public-post

0 Votes | 0 Replies

free-public-post Edelwiess

2.2 years ago

Delta 3.0k

1 Vote | 0 Replies

on-campus free-public-post mastercard

2.2 years ago

Delta 3.0k

0 Votes | 0 Replies

linkedin free-public-post on-campus

2.2 years ago

Delta 3.0k

5 Votes | 8 Replies

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

0 Votes | 0 Replies

coding-round SLB free-public-post

2.2 years ago

Delta 3.0k

1 Vote | 2 Replies

on-campus free-public-post mastercard

1 Vote | 1 Reply

coding-round free-public-post goldmansachs

0 Votes | 0 Replies

2.2 years ago

kunal aggarwal • 0

0 Votes | 1 Reply

on-campus online-test media.net

2.2 years ago

retarded_coder • 0

1 Vote | 2 Replies

lowe's-india coding-round free-public-post

0 Votes | 2 Replies

cisco coding-round on-campus free-public-post

0 Votes | 0 Replies

coding-round free-public-post ringcentral

2.2 years ago

Delta 3.0k

0 Votes | 0 Replies

off-campus free-public-post codenation

2.2 years ago

Delta 3.0k

7 Votes | 2 Replies

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

4 Votes | 0 Replies

media.net coding-round free-public-post

2.2 years ago

Delta 3.0k

1 Vote | 2 Replies

Atlassian coding-round free-public-post on-campus

0 Votes | 0 Replies

microsoft coding-round on-campus

2 Votes | 1 Reply

off-campus Nvidia free-public-post

1 Vote | 0 Replies

coding-round ringcentral free-public-post

2.2 years ago

Delta 3.0k

1 Vote | 0 Replies

coding-round ion-group on-campus

1 Vote | 0 Replies

2.2 years ago

Abhishek Ratra • 10

0 Votes | 0 Replies

on-campus Atlassian

11 Votes | 13 Replies

meesho on-campus coding-round free-public-post

0 Votes | 0 Replies

microsoft coding-round on-campus

2.1 years ago

PoGo 2.5k

4 Votes | 3 Replies

DBOI coding-round free-public-post on-campus

0 Votes | 1 Reply

on-campus coding-round free-public-post arcesium

6 Votes | 3 Replies

coding-round free-public-post American-Express

1 Vote | 1 Reply

on-campus free-public-post coding-round alphagrep

0 Votes | 1 Reply

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

0 Votes | 1 Reply

on-campus free-public-post goldmansachs

2 Votes | 2 Replies

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

0 Votes | 0 Replies

on-campus uber free-public-post coding-round

2.2 years ago

Delta 3.0k

0 Votes | 3 Replies

on-campus atlassian free-public-post coding-round

0 Votes | 0 Replies

coding-round microsoft on-campus

2 Votes | 3 Replies

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

1 Vote | 2 Replies

on-campus Graviton free-public-post coding-round

1,111 results • Page 12 of 28

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

Raniganj, 15 minutes ago

Varanasi, 21 minutes ago

Varanasi, 23 minutes ago

Varanasi, 49 minutes ago

Delhi, 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