1 result • Page 1 of 1
Showing : Barclaysreset
1 result • Page 1 of 1
Join us on Telegram for instant updates

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now
Top Problem Solvers
This Month
Meet the Champions
Recent Locations • All
codingkaro.in, 5 hours ago
MNIT Jaipur, 13 hours ago
Durg, 1 day ago
Patna, 1 day ago
Rewari, 2 days ago
Recent Replies
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 &lt;= 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…
Comment: Pair of Pairs by admin 1.2k
<p>Hi @Kartik Dutta-9688 have added the answer below.&nbsp;<br /> Could you add which company&#39;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&#39;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.&nbsp;<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…
Comment: TCS | Online Assessments | Deleting Channel by Vikas Kumar Vikrant • 0
<p>can you explain the solution2.?</p>
Comment: Navi OA by BHASKAR JHA • 10
<p>it seems test case is not handled properly. answer must be 3 only.</p>
Comment: Google | September, 2022 | Recent Interview Questions by Jigyansu • 50
<p>If you are not using PBDS, then I think you have to use Coordinate Compression in order to use values as indexes as Array elements can g…
Comment: Trilogy Innovations(CodeNation) Coding Round, 5th March by Abhimanyu Chadha 10
<p>The problem is live on TJO, use this link <a href="http://thejoboverflow.com/problem/373/">http://thejoboverflow.com/problem/373/</a></p…