TheJobOverflow

Request Recent Questions Now!

0 Votes | 0 Replies

hackathon google

8 Votes | 6 Replies

coding-round google free-public-post

1 Vote | 0 Replies

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

1 Vote | 7 Replies

free-public-post tredence

2.2 years ago

Abhilash Kalyanakrishnan • 300

1 Vote | 0 Replies

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

6 Votes | 3 Replies

coding-round cisco

5 Votes | 1 Reply

cisco free-public-post

3 Votes | 0 Replies

barclays free-public-post coding-round

0 Votes | 0 Replies

jpmc coding-round on-campus

1 Vote | 0 Replies

Cisco coding-round free-public-post

1 Vote | 0 Replies

cisco coding-round

0 Votes | 0 Replies

on-campus jpmc coding-round

5 Votes | 9 Replies

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

4 Votes | 1 Reply

os juspay free-public-post coding-round trees

5 Votes | 2 Replies

interview off-campus interview-experience google

0 Votes | 0 Replies

2 Votes | 0 Replies

Atlassian Swiggy thoughtspot coding-round

2 Votes | 0 Replies

coding-round Expedia free-public-post

27 Votes | 19 Replies

free-public-post online-assessments google

2.1 years ago

sober 100

1 Vote | 0 Replies

coding-round Lendingkart free-public-post

2 Votes | 3 Replies

arrays coding-round off-campus

0 Votes | 0 Replies

free-public-post deshaw coding-round

2 Votes | 0 Replies

interview on-campus free-public-post providence-india

2.5 years ago

Aman Jaiswal • 20

0 Votes | 1 Reply

1 Vote | 2 Replies

15 Votes | 9 Replies

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

7 Votes | 3 Replies

trilogy-innovations codenation OAs free-public-post intern

1 Vote | 1 Reply

tibra free-public-post quant off-campus coding-round

1 Vote | 0 Replies

interview jio free-public-post on-campus

2 Votes | 0 Replies

free-public-post off-campus interview fullstackdeveloper sde

3 Votes | 0 Replies

free-public-post OAs Niro-Money coding-round

4 Votes | 4 Replies

free-public-post interview visa

6 Votes | 3 Replies

Oracle free-public-post on-campus interview

1 Vote | 0 Replies

interview free-public-post Confluent on-campus

2 Votes | 0 Replies

Internship DeShaw free-public-post Interview

1 Vote | 4 Replies

free-public-post coding-round OAs Edfora

6 Votes | 3 Replies

3 Votes | 6 Replies

free-public-post coding-round OAs Tekion job

4 Votes | 4 Replies

Samsung OAs free-public-post coding-round

1 Vote | 0 Replies

on-campus increff free-public-post interview sde1

966 results • Page 15 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

Coimbatore, 6 minutes ago

New Delhi, 8 minutes ago

Bhubaneswar, 18 minutes ago

Haldwani, 45 minutes ago

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