TheJobOverflow

Request Recent Questions Now!

No posts found.

0 results • Page 1 of 1

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

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 :)

Answer: AQR, Recent Online Assessment Questions (30th August 2023) | Program to accept ( by Ignotus2614 • 0

from collections import deque dx = [1, 1, -1, -1] dy = [-1, 1, 1, -1] def read_input(): n = int(input()) vec …

Comment: Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters by Rishikesh • 0

Bro, I found it. the test case's expected output is wrong try changing the condition of when 2 heros occur at same coordinate (p1 occur…

Comment: Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters by Rishikesh • 0

Bro, same issueee here did you find why were you getting WA on 17?

Comment: CRED | 20th October | Online Assessments by jolly • 0

did u check for the and ?? , as I think question is stating about a marathon meaning each node is visited only once during a path from star…

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Meet the Champions

Recent Votes

Answer: Turvo, Recently asked online assessment questions (23rd September 2023) | Custom

Answer: Cisco | 3rd October | Online Assessments

Intuit OA | SWE Internship 2023 | IIT KGP

Flipkart | October, 2022 | Interview Questions

Answer: ThoughtSpot , Online Assessment (IIT Kanpur) | Cover them All | Flip Operations

Answer: Intuit , Online Assessment(17th August 2023) | CIRCUS - FIRE - 1 | SCHEDULING TR

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

Google | SWE | Online Screening | 22-08-2020

Answer: BNY Mellon, Recent Online Assessment (31st August 2023) | Circuit Output | Compa

Recent Locations

Mumbai, 4 minutes ago

Bengaluru, 13 minutes ago

Sangāreddi, 31 minutes ago

Varanasi, 1 hour ago

Jaipur, 2 hours ago

Recent Awards • All

Great Question to Delta 2.9k

Great Question to admin 1.6k

Appreciated to Rohit • 600

Great Question to Rohit • 600

Land on Leaderboard & Claim your Hamper

Top Problem Solvers

You have successfully registered to our first ever Exclusive Contest!