TheJobOverflow

Request Recent Questions Now!

0 Votes | 0 Replies

Trianz-Digital on-campus coding-round free-public-post

23 months ago

PoGo 2.4k

2 Votes | 0 Replies

on-campus Wissen-Technology free-public-post

0 Votes | 0 Replies

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

23 months ago

PoGo 2.4k

0 Votes | 0 Replies

free-public-post MAQ-Software coding-round

23 months ago

PoGo 2.4k

0 Votes | 0 Replies

ConsultAdd Interview Fresher

5 months ago

Ayush Verma • 10

0 Votes | 0 Replies

finastra java interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

increff interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde interview amazon sde1 internship

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

interview amazon sde sde1

0 Votes | 0 Replies

autodesk interview sde sde1

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

interview sde eq-technologies sde1

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

hexagon interview sde sde1

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

interview mts oracle

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 sde bytedance interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 fast-retailing sde interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 sde microland interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 sde interview netradyne

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

oracle ocs interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

fullstack schlumberger interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

visa internship interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 sde wayfair interview

5 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 sde zenon interview

5 months ago

Nishant Agarwal • 0

1 Vote | 1 Reply

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

0 Votes | 0 Replies

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

23 months ago

PoGo 2.4k

0 Votes | 0 Replies

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

23 months ago

PoGo 2.4k

0 Votes | 0 Replies

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

23 months ago

PoGo 2.4k

1 Vote | 2 Replies

goldmansachs coding-round free-public-post

5 Votes | 2 Replies

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

6 Votes | 4 Replies

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

2 Votes | 1 Reply

coding-round Samsung on-campus

3 Votes | 0 Replies

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

23 months ago

Delta 3.0k

1 Vote | 0 Replies

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

23 months ago

PoGo 2.4k

1 Vote | 1 Reply

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

2 Votes | 0 Replies

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

23 months ago

PoGo 2.4k

0 Votes | 6 Replies

American-Express on-campus free-public-post

3 Votes | 6 Replies

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

1 Vote | 3 Replies

goldmansachs on-campus free-public-post

0 Votes | 3 Replies

British-Telecom coding-round free-public-post

1 Vote | 0 Replies

Societe-Generale free-public-post on-campus

23 months ago

PoGo 2.4k

13 Votes | 2 Replies

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

966 results • Page 7 of 25

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

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[]. …

Answer: Uber OA | IIT Madras | SWE Internship | 2023 by ANIRUDH • 0

Problem 1: Binary Cafeteria Solution: Mathematical Approach This is a combinatorial counting problem with a unique property that simp…

Comment: BNY Mellon, Recently asked online assessment question (23rd September 2023) | BI by Vaibhav Aryan • 0

n

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Vatsal Patel • 0

Approach: Problem 1: K Closest Approach 1 (Easy) : - Time Complexity: O(N Log N) - Auxiliary Space Complexity: O(N) - Steps: …

Answer: Airtel, Recently Asked Online Assessment Question (28th September 2023) | Specia by Suryansh Rishit • 0

Speacial Array Approach The problem asks us to determine if a sequence is "special" - meaning no two adjacent numbers have …

Answer: Amazon Hackon, Online Assessment Questions (28th September 2023) | Magic Vowels by Suryansh Rishit • 0

Problem-1 : Approach : We need to process the string and identify groups of consecutive vowels. For each such group: If it…

Answer: Uber | 6 Months Internship Dirve | Maximum MEX | Minimum Time to Reach Bottom of by ANIRUDH • 0

Problem-2: Maximizing MEX In this problem, we are given an integer array a of size n and a non-negative integer m, representing the numb…

Comment: Zepto, Recently Asked On-Campus Questions in IITs, October 2022 | A Sum of Coins by Hrishabh Patel • 10

But for this we will be needing 1e8 size vector as i<=1e3 j<=100 and rem<=1e3

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Answer: Juspay | 21st October | Online Assessments | Locking the tree of space

Answer: Juspay | 21st October | Online Assessments | Locking the tree of space

Answer: PhonePe | 9th October | Online Assessments

Answer: Juspay | 21st October | Online Assessments

Answer: Juspay | 21st October | Online Assessments

Answer: DevRev , Online Assessment (IIT Kanpur) | Implementing a Rate Limiter | Rectangu

Answer: Juspay | 21st October | Online Assessments | Locking the tree of space

Answer: MediaNet, Recently Asked Online Assessments in October, 2022

MediaNet, Recently Asked Online Assessments in October, 2022 | Omega Primes | Fruits on Tree | Damaged Roads

Answer: Juspay | 21st October | Online Assessments | Locking the tree of space

Recent Locations

Moscow, just now

Varanasi, just now

Indore, 1 minute ago

Bhopal, 2 minutes ago

New Delhi, 3 minutes ago

Recent Awards • All

Teacher to Ashutosh Saini • 30

Great Question to John 950

Great Question to John 950

Appreciated to admin 1.7k

Great Question to John 950

Great Question to John 950

Great Question to admin 1.7k

Great Question to xINFERNOx • 40

Appreciated to PoGo 2.4k

Appreciated to PoGo 2.4k