TheJobOverflow

Request Recent Questions Now!

Showing : amazon • reset

7 Votes | 0 Replies

amazon interview free-public-post

5 Votes | 0 Replies

interview coding-round amazon on-campus

3.0 years ago

4 Votes | 5 Replies

coding-round amazon on-campus

1 Vote | 1 Reply

amazon on-campus coding-round

2 Votes | 0 Replies

amazon oncampus

3.1 years ago

papa 410

6 Votes | 2 Replies

bar-raiser interview amazon

0 Votes | 0 Replies

4.4 years ago

Mod565r44 • 0

6 Votes | 1 Reply

sde coding-round free-public-post amazon

0 Votes | 0 Replies

off-campus coding-round amazon SDE

2 Votes | 0 Replies

sde on-campus amazon interview free-public-post

4.9 years ago

Shubhendu Goel • 450

4 Votes | 0 Replies

amazon on-campus interview free-public-post

2 Votes | 0 Replies

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

4.9 years ago

Shubhendu Goel • 450

4 Votes | 0 Replies

free-public-post online-round amazon sde on-campus

4.9 years ago

Shubhendu Goel • 450

2 Votes | 1 Reply

amazon coding-round

0 Votes | 1 Reply

On-Campus StringFunctions amazon

5.4 years ago

mod2 870

0 Votes | 1 Reply

On-Campus StringFunctions amazon

0 Votes | 1 Reply

dp amazon sde free-public-post

1 Vote | 0 Replies

dp amazon sde off-campus

5.4 years ago

58 results • Page 2 of 2

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

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 • 10

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 • 0

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…

Answer: Oracle | 13th October | Online Assessments | Decrypt by .. • 0

#include <bits/stdc++.h> using namespace std; #define int long long void solve(){ int n; cin>>n; …

Answer: Intuit OA | Furious Dhoni | Lost In The Woods | Credential Verification - I | S by ANIRUDH • 0

Problem-2 LOST IN THE WOODS This problem requires generating a navigation signal string to guide a person named Bob from a starting point …

Answer: Intuit OA | Furious Dhoni | Lost In The Woods | Credential Verification - I | S by ANIRUDH • 0

Problem-1 FURIOUS-DHONI In this problem, we are given an NtimesM grid of integer values. The goal is to find the maximum possible score …

Answer: Barclays | 12th October | Online Assessments | The Chemist | Maximum Partition | by HEET KEYUR SHAH • 0

QUESTION 1 #include <bits/stdc++.h> using namespace std; void solve(){ in…

Answer: Amazon | SDE | 25 November by Suryansh Rishit • 0

Approach The task is to replace all spaces in a string with %20 considering only the first trueLength characters. We iterate through th…

Answer: Amazon | OA 2020 | Shortest Distance Between Robots | August 19, 2020 by Suryansh Rishit • 0

Approach We need to find the smallest squared distance between any two robots in a 2D plane. A brute force approach would check all pairs,…

Answer: Uipath, Online Assessment (IIT Roorkee) | Maximum Common Companies | Grouping Ma by Srivarsha • 20

Solution for Common Companies: Approach: Reading Input : Read all edges as (u, v, company) into edges[]. …

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Sprinklr OA || IIT ROORKEE || 13 - 10 - 23 || LimitLess || Split || The Matrix

Visa, Recent Online Assessment Questions (21st August 2023) | Two Cities (A And B) | Nservers | Number line | String Word

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au

Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au

Tredence Analytics, Online Assessment Questions (18th September 2023) | Master Chefs | Game of Thrones | Parenting Study | Mystery Keys | T-Missing Element

Zscaler, Recently Asked Online Assessment Questions (26th September 2023) | Range Selection | Transferable Weights

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

Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters | Minimize Travel Tax | Expected Path Length - III | Three Subarrays

Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters | Minimize Travel Tax | Expected Path Length - III | Three Subarrays

Media.net OA | 29 july | MNIT JAIPUR

Recent Locations

Varanasi, just now

Surat, 9 minutes ago

Hyderabad, 16 minutes ago

Delhi, 20 minutes ago

Dhanbad, 26 minutes ago

Recent Awards • All

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 970

Popular Question to pillaisamarth • 30

Student to pillaisamarth • 30