TheJobOverflow

Join us on Telegram for instant updates

0 Votes | 0 Replies

coding-round coderush free-public-post

7 days ago

John 500

12 Votes | 4 Replies

off-campus OA trilogy-innovations free-public-post codenation

3 Votes | 3 Replies

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

6 Votes | 3 Replies

trilogy-innovations codenation free-public-post intern OAs

0 Votes | 4 Replies

on-campus free-public-post product Confluent

8 Votes | 3 Replies

trilogy-innovations codenation free-public-post OAs product

6 Votes | 13 Replies

Uber free-public-post on-campus product

10 Votes | 7 Replies

OAs intern free-public-post product adobe

20 days ago

John 500

22 Votes | 8 Replies

product free-public-post Flipkart interview

22 days ago

John 500

2 Votes | 1 Reply

product OAs free-public-post Juspay

4 Votes | 5 Replies

OAs free-public-post Atlassian Product

3 Votes | 4 Replies

free-public-post Mahindra service OAs

3 Votes | 5 Replies

Atlassian Online-Assessments free-public-post

2 Votes | 6 Replies

Goldman-Sachs OA free-public-post

18 days ago

John 500

9 Votes | 3 Replies

intuit free-public-post coding-round

8 Votes | 0 Replies

free-public-post coderush coding-round

6 days ago

admin 1.2k

2 Votes | 0 Replies

coding-round coderush

17 results • Page 1 of 1

Join us on Telegram for instant updates

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Our First Ever Contest

Exclusive Contest Series for this month only for our first 1000 users!

Filter Posts by Company

Recent Votes

Comment: Mahindra and Mahindra | 12th October | Online Assessments

Comment: Mahindra and Mahindra | 12th October | Online Assessments

Comment: Mahindra and Mahindra | 12th October | Online Assessments

Comment: Goldman Sachs | 8th October | Online Assessment | Analyst

Trilogy Innovations(CodeNation) Coding Round, 5th March

Trilogy Innovations(CodeNation) Coding Round, 5th March

Answer: Codenation OA | 5th March

Answer: BNY Mellon, Recently Asked Questions in IIT-KGP on 6th November, 2022

Answer: Codenation OA | 5th March

Answer: Trilogy Innovations(CodeNation) Coding Round, 5th March

Recent Locations • All

National Institute of Technology, Rourkela, 1 day ago

IIT Ropar, 1 day ago

Greater Noida, Uttar Pradesh, 3 days ago

codingkaro.in, 7 days ago

Vietnam, 24 days ago

Recent Awards • All

Great Question to John 500

Great Question to John 500

Popular Question to Vijay • 0

Great Question to John 500

Great Question to John 500

Appreciated to admin 1.2k

Scholar to Ganesh Aggarwal 50

Teacher to Ganesh Aggarwal 50

Popular Question to ashish.suman927 • 40

Scholar to Ujjwal Srivastava 200

Recent Replies

Comment: Mahindra and Mahindra | 12th October | Online Assessments by Jigyansu Nanda • 20

<p>Thanks for the article</p>

Answer: DE SHAW | February 2023 | Online Assessments by hardik kapoor 80

<h1><strong>Solution 2</strong></h1> <h2><u><strong>Overview</strong></u></h2> <p>In this question, we are given two integers, num1 a…

Answer: Trilogy Innovations(CodeNation) Coding Round, 5th March by Ayush Gangwani 710

<h1>Problem 1 Solution</h1> <h2>Topics Involved / Prerequisites</h2> <ul> <li>Sweep line</li> <li>Sorting</li> <li>Segment Tree / Bina…

Answer: Codenation OA | 5th March by Ayush Gangwani 710

<h1>Problem 3 Solution</h1> <h2>Topics Involved / Prerequisites</h2> <ul> <li><strong>Number Theory</strong> <ul> <li>Modular Arithm…

Answer: Codenation OA | 5th March by Ayush Gangwani 710

<h1>Problem 4 Solution</h1> <h2>Topics Involved / Prerequisites</h2> <ul> <li>Dynamic Programming</li> </ul> <h2>Overview</h2> <p>We c…

Answer: Codenation OA | 5th March by Ayush Gangwani 710

<h1>Problem 2 Solution</h1> <h2>Topics Involved / Prerequisites</h2> <ul> <li>Lowest Common Ancestor</li> <li>Prefix Sums</li> <li>Dyn…

Comment: Confluent, Recently Asked On-Campus Assessments in IIT-G, October, 2022 by Shardul Pathak • 0

<p>🙋I am getting wrong ans on test case 4 for this question</p>

Comment: Atlassian | 15th October | Online Assessments by Vineet Kumar • 0

<p>Thank you so much for noticing this.</p>

Comment: Atlassian | 15th October | Online Assessments by Ayush Gangwani 710

<p>For the testcase<br /> 7<br /> 1 -1 -1 1 -1 1 1<br /> 2 2 2 2 11 11 4<br /> Your answer is:<br /> 4 5 6<br /> Correct answer is:<br /> 2…

Comment: Mahindra and Mahindra | 12th October | Online Assessments by Gigaliths 390

<p>It is possible to use BIT for range min/max queries. You may refer the following article : <a href="https://stackoverflow.com/quest…

Comment: Atlassian | 15th October | Online Assessments by Vineet Kumar • 0

<p>/* </p> <p>Can anyone tell me what am  i doing  wrong in my code ?</p> <p>It is  failing on Test Case 31</p> <p>*…

Answer: Atlassian | 27th September | Online Assessments | SDE by Vineet Kumar • 0

<p>/*</p> <p>solution for problem Nice Subarry.</p> <p>Here i am using the concept of sliding window.</p> <p>*/// Online C++ Compiler<br…

Answer: Juspay | 21st October | Online Assessments by Shreyansh Kaushik • 10

<p> </p> <pre> <code class="language-java">import java.util.*; public class Main { static class TreeNode{ String name; …

Answer: Mahindra and Mahindra | 12th October | Online Assessments by Jigyansu Nanda • 20

<p>I solved it using segment tree on flattened tree. The tutorial says we can also use BIT for range queries. I might be wrong, but I think…

Answer: DE SHAW | February 2023 | Online Assessments by Rishabh Verma 80

<h1><strong>Solution 3 : minimum cost path</strong></h1> <hr /> <p><strong>Overview : </strong>In this question we have to find the a…