TheJobOverflow

Request Recent Questions Now!

Showing : job • reset

12 Votes | 5 Replies

Online-Assessments microsoft job coding-round

3 Votes | 6 Replies

free-public-post coding-round OAs Tekion job

0 Votes | 1 Reply

cred product job free-public-post OAs

11 Votes | 2 Replies

free-public-post job OAs uber product

1 Vote | 2 Replies

free-public-post salesforce job OAs product

0 Votes | 1 Reply

job amd OAs intern product

10 Votes | 8 Replies

free-public-post job coding-round product sprinklr

2 Votes | 3 Replies

free-public-post job Phonepe coding-round product

8 results • Page 1 of 1

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

Answer: Accenture , Online Assessment | 248 Numbers | Find Number | 10 th August 2023 by Anonymous • 0

Find Number #include<bits/stdc++.h> using namespace std; int main(){ string s; int ans=0; &…

Answer: Can anyone help me solve this? by idk • 0

are these for amazon intern OA?

Comment: Meesho OA | 2023 by Ayush Agarwal • 0

Say when the terms are -2 and -4 , then |-2 + -4| = 6 and not -6 hence | -2 - -4| + 6 = 8 which is not same as 2*(-2) So I feel…

Answer: Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters by Pradumna Awasthi • 0

I used an array of sets for this question, and it passed two test cases but failed for the limiting memory cases.

Comment: JP Morgan Chase, Recently Asked Online Assessment Questions (1st October 2023) | by Madhav Maheshwari • 0

In which college these questions were asked?

Answer: JP Morgan Chase, Recently Asked Online Assessment Questions (1st October 2023) | by Aryan • 0

Q1. Solution. #include <bits/stdc++.h> using namespace std; void checkmodulo(int x,map<int,int> &mpp){…

Answer: Amazon Hackon (SET - 2), Online Assessment Questions (28th September 2023) | Shi by Ankit Josh • 0

Question 2: This should probably work. #include <bits/stdc++.h> using namespace std; int main() { int n; cin …

Comment: BNY Mellon , Online Assessment | String Modification | Meeting Assistant | Bina by Aman • 0

while calculating v, shouldn't we srart from the highest bit, i.e. start our loop from j=31?

Comment: Amazon Hackon, Online Assesment Asked Question | Tech Curator | Given Integer N by Ankit Josh • 0

Question 2: #include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<vector<int>>…

Answer: Rupeek, Recently Asked Online Assessment Questions | Character Set Count | 29th by Vatsal Agarwal • 0

cool

Comment: Rupeek, Recently Asked Online Assessment Questions | Character Set Count | 29th by Vatsal Agarwal • 0

cool

Answer: Amazon Hackon, Online Assesment Asked Question | Tech Curator | Given Integer N by Komal Kumari • 0

Question 1 #include<bits/stdc++.h> using namespace std; int func(int N){ int i = 2; &nbs…

Comment: Uber, Recently asked On-Campus OAs in IIT-D on 30th October, 2022 by Vikas Kumar • 0

#include using namespace std; int main() { int n; cin>>n; vectora(n), r(n); long long mina=1e18, minr=1e18; …

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Meet the Champions

Recent Votes

Meesho OA | 2023

Comment: Meesho OA | 2023

Paypal , Recent Online Assessment Questions (19th September 2023) | Task Scheduling | Sequential String

PhonePe , Recent online Assessment (11th August 2023 SET- 2) | PhonePe Team Formation | Card Verification

PhonePe, Recent Online Assesment (19th August 2023) | Arjun's Birthday

Mercari, Recently asked Online Assessment Questions (SDE | 26th September 2023) | Special city

Mercari, Recent Online Assessment Questions (20th September 2023)| Women In Tech | Madam C.J. Walker's Business Plan

Recent Locations

Mumbai, 7 minutes ago

Mumbai, 8 minutes ago

Mumbai, 17 minutes ago

Mumbai, 18 minutes ago

Mumbai, 20 minutes ago

Recent Awards • All

Appreciated to Delta 2.2k

Voter to Hari Krishna • 0

Appreciated to Delta 2.2k

Supporter to Hari Krishna • 0

Land on Leaderboard & Claim your Hamper

Top Problem Solvers

You have successfully registered to our first ever Exclusive Contest!