TheJobOverflow

Join us on Telegram for instant updates

No posts found.

0 results • Page 1 of 1

Join us on Telegram for instant updates

Filter Posts by Company

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Meet the Champions

Recent Votes

Wells Fargo, Recently Asked On-Campus Assessments in IIT-K, November, 2022

Answer: Mastercard, Recently asked On-Campus Question in IITs, November 2022

Answer: Google Girl Hackathon 2023 OA question

Google Girl Hackathon 2023 OA question

MediaNet, Recently Asked Online Assessments in October, 2022

Recent Locations • All

codingkaro.in, 5 hours ago

MNIT Jaipur, 6 hours ago

Patna, 6 hours ago

Durg, 1 day ago

Rewari, 6 days ago

Recent Awards • All

Scholar to slime • 50

Teacher to slime • 50

Popular Question to Prakhar Dubey • 30

Great Question to Aman Jaiswal • 10

Teacher to Mohammad Zaid • 30

Appreciated to John 570

Good Question to John 570

Commentator to Jigyansu • 50

Popular Question to Aman Jaiswal • 10

Great Question to John 570

Recent Replies

Comment: Zepto, Recently Asked On-Campus Questions in IITs, October 2022 by admin 1.2k

<p>Hi @gaurav kanojiya-20727, yes that problem has been moved to the premium section, accessible only by premium users.</p>

Answer: Zepto, Recently Asked On-Campus Questions in IITs, October 2022 by gaurav kanojiya • 10

<p>q2 link is not working its rendering all problems not q2 </p>

Answer: Mastercard, Recently asked On-Campus Question in IITs, November 2022 by gaurav kanojiya • 10

<p>for question 1:</p> <p>we can modify price => price+delivery fee</p> <p>and then we will buy from that shop with minimum price&…

Answer: Google Girl Hackathon 2023 OA question by slime • 50

<h2><strong>[P1] Maximize Equal Numbers</strong></h2> <h3><strong>Brief</strong></h3> <p>Given N integers and an integer K, you are a…

Comment: DE SHAW | February 2023 | Online Assessments by Rishabh Verma 90

<p>you are right it can not be done by dfs normally........</p>

Comment: DE SHAW | February 2023 | Online Assessments by Vipul Jain • 0

<p>I think we should apply bfs instead of dfs as we want minimum possible edges to reach (n-1) with weight <= mid.. As I infer dfs would…

Comment: Tiktok Singapore | Frontend Engineer 1 by Abhilash Kalyanakrishnan 10

<table> <tbody> <tr> <td><code>@Yash kumar yadav-11086</code></td> </tr> </tbody> </table> <p>Thanks for sharing your solution co…

Answer: Tiktok Singapore | Frontend Engineer 1 by Yash kumar yadav • 10

<p><img alt="angel" src="https://d3uam8jk4sa4y4.cloudfront.net/static/ckeditor/ckeditor/plugins/smiley/images/angel_smile.png" style="heigh…

Answer: TCS | Online Assessments | Deleting Channel by Digamber Laxman Chaure • 0

Comment: Pair of Pairs by admin 1.2k

<p>Hi @Kartik Dutta-9688 have added the answer below. <br /> Could you add which company's coding round is this from? And other ta…

Answer: Pair of Pairs by admin 1.2k

<ol> <li>Process Q pairs first, create an adjacency list, with left integer of the pair as key and right one as value.</li> <li>Create …

Comment: Pair of Pairs by Kartik Dutta • 20

<p>Not sure how to get better time complexity than T*Q*N.<br /> <br /> Right now, what I am thinking is that per testcase,</p> <p>For each…

Comment: TCS | Online Assessments | Deleting Channel by Gigaliths 460

<p>To simplify the problem, we can consider the index of the last remaining node instead of its value. Let's denote the index of the la…

Comment: Navi OA by Gigaliths 460

<p>The following problem has been updated based on the user challenge raised by Rohit. <br /> Do reach out to us using the challenge b…

Comment: Paytm, Previously Asked Questions for Online Assessments by Jigyansu • 50

<p>I think the beauty of this problem lies more in an interview setting, where they ask you to solve in O(1) space instead of O(N). But any…

Land on Leaderboard & Claim your Hamper

Top Problem Solvers

You have successfully registered to our first ever Exclusive Contest!