TheJobOverflow

Request Recent Questions Now!

0 Votes | 2 Replies

coding-round off-campus amazon free-public-post

1 Vote | 0 Replies

sde1 sde free-public-post

0 Votes | 2 Replies

sde1 interview coding-round sde free-public-post

0 Votes | 1 Reply

sde free-public-post on-campus

0 Votes | 0 Replies

amazon off-campus free-public-post coding-round

2.0 years ago

Delta 3.0k

0 Votes | 2 Replies

amazon off-campus free-public-post coding-round

0 Votes | 0 Replies

2.0 years ago

Abhishek Rinwa • 0

1 Vote | 1 Reply

amazon off-campus free-public-post coding-round

0 Votes | 1 Reply

coding-round off-campus amazon free-public-post

6 Votes | 4 Replies

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

0 Votes | 0 Replies

coding-round DXC-Technology free-public-post

2.0 years ago

Delta 3.0k

0 Votes | 1 Reply

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

0 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

1 Vote | 0 Replies

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

2.0 years ago

Delta 3.0k

0 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

0 Votes | 1 Reply

off-campus coding-round free-public-post Flipkart

24 Votes | 4 Replies

on-campus media.net coding-round free-public-post

0 Votes | 0 Replies

on-campus free-public-post stage-street

2.0 years ago

Delta 3.0k

4 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

0 Votes | 0 Replies

on-campus coding-round free-public-post sahaj.ai

2.0 years ago

Delta 3.0k

2 Votes | 1 Reply

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

3 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

0 Votes | 0 Replies

coderush coding-round

6 Votes | 3 Replies

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

0 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

0 Votes | 0 Replies

free-public-post on-campus coding-round Car-Trade

2.0 years ago

Delta 3.0k

1 Vote | 0 Replies

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

2.0 years ago

Delta 3.0k

0 Votes | 0 Replies

Air-India on-campus coding-round free-public-post

2.0 years ago

Delta 3.0k

0 Votes | 1 Reply

coding-round on-campus free-public-post Wissen-Technology

0 Votes | 0 Replies

free-public-post sahaj.ai

2.0 years ago

Chenchali Tarun Kumar • 0

0 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

1 Vote | 0 Replies

Air-india coding-round free-public-post on-campus

2.0 years ago

Delta 3.0k

2 Votes | 1 Reply

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

0 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

1 Vote | 0 Replies

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

2.0 years ago

Delta 3.0k

0 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

0 Votes | 0 Replies

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

2.0 years ago

Delta 3.0k

3 Votes | 2 Replies

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

11 Votes | 19 Replies

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

1 Vote | 0 Replies

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

966 results • Page 4 of 25

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

Comment: VISA, Summer Internship Interview Experience in NITs, 2023 by Anil Thungesh RK • 0

For the testcases that you gave , it still works with the greedy approach right? maybe the solution you said is for Minimising the sum of A…

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

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

Bhubaneswar, just now

Hyderabad, 4 minutes ago

Bhubaneswar, 40 minutes ago

Delhi, 55 minutes ago

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