TheJobOverflow

No posts found.

0 results • Page 1 of 1

Filter Posts by Company

Recent Replies

Answer: Navi OA by Yuvraj singh Kanoujia • 0

I have a doubt in this problem as this same problem is also present in the leetcode Link:-Problem Link But the solution that …

Answer: Graphs Contest: Editorials by Manas Kumar Verma by Chinmay Ravi Jha • 0

What should I put in the "referral" field? Or keep it blank?

Answer: Tiktok Singapore | Online Assessment | Sep 2022 by Vibhaas Nirantar Srivastava • 0

The 9th testcase for Problem 1 are probably wrong, seeing that problem author himself has incorrect solution. Here is an alternate solution…

Answer: SAP | OA | 2023 by Avikam Bir • 10

import java.util.Scanner; public class MartinJogging { public static void main(String[] args) { …

Comment: Oracle | 13th October | Online Assessments | Decrypt by Tafheem Ahemad • 0

int solve(int a,int b,int c){ int ans=0; for(int i=0;i<31;i++){ if((c>&…

Answer: ThoughtSpot , Online Assessment (IIT Kanpur) | Cover them All | Flip Operations by Sahil Das • 10

Flip Operations Solution-> #include<bits/stdc++.h> using namespace std; class Solution { public: int n; &n…

Answer: Webstaff, Web Developer Test, Online Assignment Test (20/9/2023) | Hiring Drive by Mousam Kumari • 0

Code of above ⬆ it will give tle please optimize it. #include<bits/stdc++.h> using namespace std; #define int long long in…

Answer: GE Digital - Set 2 | NIT Jamshedpur 2023 | Number Game | Equations and queries by yash • 0

#include <iostream> #include <vector> using namespace std; const int MOD = 1e9 + 7; const int MAX_N = 100…

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

Please give the complete code

Comment: Uber OA (on campus) | 6 Month Intern by Md Nihal • 0

no you can move in any 4 directions it will cover only 2 directions left and down

Answer: Uber OA (on campus) | 6 Month Intern by Md Nihal • 0

1. #include<bits/stdc++.h> using namespace std; void __solve() { int n, m; cin >> n >> m; vector&l…

Comment: Goldman Sachs | 30th September | Online Coding Rounds | Traveler Fund | Jewelle by mhdi • 0

I guess we can also solve using tries. we will count the longest branch with consicutive end points.

Comment: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path by Nalluri Uday Subrahmanya Kishore • 0

The TC of your algorithm is exponential as we end up adding n^(m) elements to the queue

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

@admin can you tell how can one get premium for TJO?

Comment: Google | Complex Subsequence | Subtree XOR by Vivek • 0

code you provide a code for this :)

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Interview Experience for ConsultAdd | Fresher | First Experience

Answer: Amazon Hackon (SET - 2), Online Assessment Questions (28th September 2023) | Shi

Answer: Juspay | 21st October | Online Assessments

Answer: Nvidia, Recent Online Assessment Question | Minimum health | Avoiding Landmines

Graphs Contest: Editorials by Manas Kumar Verma

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

Answer: DE Shaw (DESIS Ascend | 17th September 2023) | Subarray Sums | Array Generator

Answer: Tiktok Singapore | Online Assessment | Sep 2022

Recent Locations

Bulandshahr, 32 minutes ago

Amsterdam, 42 minutes ago

Mandi, 54 minutes ago

Chennai, 56 minutes ago

Mumbai, 1 hour ago

Recent Awards • All

Appreciated to John 910

Great Question to John 910

Great Question to Delta 2.9k