TheJobOverflow

Request Recent Questions Now!

Showing : dboi • reset

1 Vote | 1 Reply

on-campus coding-round free-public-post DBOI

0 Votes | 0 Replies

on-campus coding-round free-public-post DBOI

17 months ago

PoGo 2.4k

0 Votes | 0 Replies

free-public-post coding-round DBOI on-campus

17 months ago

PoGo 2.4k

2 Votes | 1 Reply

DBOI on-campus coding-round free-public-post

2 Votes | 2 Replies

DBOI coding-round free-public-post on-campus

7 Votes | 4 Replies

free-public-post coding-round DBOI on-campus

7 Votes | 4 Replies

coding-round DBOI on-campus free-public-post

4 Votes | 3 Replies

DBOI coding-round free-public-post on-campus

12 Votes | 7 Replies

DBOI coding-round free-public-post on-campus

5 Votes | 2 Replies

on-campus coding-round DBOI free-public-post

28 Votes | 16 Replies

on-campus DBOI coding-round free-public-post

4 Votes | 1 Reply

on-campus DBOI FTE free-public-post

2 Votes | 0 Replies

DBOI coding-round on-campus intern

3.5 years ago

saitama_26 • 30

13 results • Page 1 of 1

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

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

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…

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Answer: Tiktok Singapore | Online Assessment | Sep 2022

Comment: Tiktok Singapore | Online Assessment | Sep 2022

Graphs Contest: Editorials by Manas Kumar Verma

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions

Answer: Google | Complex Subsequence | Subtree XOR

Answer: SAP | OA | 2023

Answer: SAP | OA | 2023

Answer: Morgan Stanley, Recent On-Campus Assessments Asked in IIT-M, November, 2022

Answer: Morgan Stanley, Recent On-Campus Assessments Asked in IIT-M, November, 2022

Recent Locations

Patna, 8 minutes ago

Kolkata, 4 hours ago

Patna, 6 hours ago

Delhi, 6 hours ago

Hyderabad, 7 hours ago

Recent Awards • All

Great Question to Delta 2.9k

Popular Question to Lovish Dua • 20

Great Question to Delta 2.9k

Great Question to admin 1.6k

Great Question to admin 1.6k

Appreciated to Rohit • 610

Great Question to Rohit • 610

Great Question to Rohit • 610

Great Question to Rohit • 610

Great Question to Rohit • 610