TheJobOverflow

Request Recent Questions Now!

Showing : coding-round • reset

44 Votes | 6 Replies

free-public-post OAs coding-round Juspay product

49 Votes | 8 Replies

coding-round oracle on-campus

25 Votes | 6 Replies

media.net OAs coding-round free-public-post

18 Votes | 12 Replies

Online-Assessments coding-round amazon free-public-post

18 Votes | 3 Replies

product google free-public-post OAs coding-round

12 Votes | 4 Replies

online-assessments coding-round TCS free-public-post

13 Votes | 7 Replies

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

49 Votes | 14 Replies

free-public-post product interview Flipkart coding-round

6 Votes | 4 Replies

free-public-post wells-fargo coding-round on-campus product

33 Votes | 10 Replies

media.net free-public-post on-campus coding-round

12 Votes | 14 Replies

free-public-post Uber coding-round on-campus product

14 Votes | 10 Replies

BNY-Mellon coding-round on-campus free-public-post

10 Votes | 6 Replies

free-public-post Product Oracle OAs coding-round

0 Votes | 5 Replies

TCS Online-Assessments free-public-post coding-round

10 Votes | 4 Replies

on-campus zomato IITs free-public-post coding-round

28 Votes | 16 Replies

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

14 Votes | 10 Replies

sde oa free-public-post coding-round hilabs

15 Votes | 9 Replies

coding-round off-campus deshaw free-public-post

9 Votes | 4 Replies

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

11 Votes | 13 Replies

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

10 Votes | 3 Replies

on-campus IITs free-public-post BNY-Mellon coding-round

1 Vote | 2 Replies

free-public-post OAs coding-round Atlassian product

7 Votes | 4 Replies

product free-public-post sprinklr OAs coding-round

5 Votes | 4 Replies

BNY-Mellon coding-round on-campus free-public-post

9 Votes | 8 Replies

product coding-round OAs google

6 Votes | 1 Reply

coding-round off-campus Seclore free-public-post

5 Votes | 6 Replies

free-public-post coding-round sprinklr

25 Votes | 4 Replies

on-campus media.net coding-round free-public-post

10 Votes | 7 Replies

free-public-post coding-round on-campus Zepto product

6 Votes | 5 Replies

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

0 Votes | 3 Replies

Sigmoid free-public-post interview trees coding-round

14 Votes | 4 Replies

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

5 Votes | 2 Replies

Juspay coding-round free-public-post off-campus

13 Votes | 8 Replies

free-public-post job coding-round product sprinklr

7 Votes | 6 Replies

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

13 Votes | 2 Replies

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

21 Votes | 9 Replies

coding-round google free-public-post

8 Votes | 8 Replies

coding-round free-public-post BNY-MELLON on-campus

26 Votes | 13 Replies

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

15 Votes | 3 Replies

product on-campus free-public-post flipkart coding-round

627 results • Page 1 of 16

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

Answer: Google | Complex Subsequence | Subtree XOR by Prakhar mishra • 0

Q 4 - Answer #include <bits/stdc++.h> using namespace std; long long cost(vector<long long> &A, long long X) { &nbs…

Answer: Google | Complex Subsequence | Subtree XOR by Prakhar mishra • 0

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int T; cin &…

Answer: GOOGLE OA | SWE Internship 2023 | Cost of Groups | Queries and Arrays | 22nd Ju by Kaushik K S • 0

//COST OF GROUPS import java.util.*; import java.io.*; public class CostOfGroupsNaive { static List<Integer>[] tree; …

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Kaushik K S • 0

//HYBRID MAXIMUM import java.util.Scanner; public class HybridMaximum { // maX VAL of the expression public static int …

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Kaushik K S • 0

// PRIME PATH import java.util.*; import java.io.*; public class Main { static int N; static int[][] G; static int[][…

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Kaushik K S • 0

//MEDIAN PATHS import java.util.*; /* * Approach * Use an adjacency list. * DFS Traversal & track paths(odd-len) * go …

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Kaushik K S • 0

//FINDING ARRAYS import java.util.*; public class FindingArrays { static final int MOD = 1000000007; // digitSumBuc…

Answer: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path by annu sevada • 0

def count_substrings_more_ones(s): n = len(s) nums = [1 if c == '1' else -1 for c in s] …

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Reddiwary Dhrutvan Reddy • 0

hybrid maximum #include <bits/stdc++.h> using namespace std; int hybridMaximum(int N, vector<int>& A, int M, vector&…

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Reddiwary Dhrutvan Reddy • 0

Prime path #include <bits/stdc++.h> using namespace std; const int MAX = 1e6 + 10; vector<int> spf(MAX); // Small…

Answer: DE Shaw OA | BITS PILANI | SWE Internship | 30th July 2023 by Reddiwary Dhrutvan Reddy • 0

Q1) #include <bits/stdc++.h> using namespace std; int smallest_subarray_infinite(vector<int>& arr, int k) { …

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Reddiwary Dhrutvan Reddy • 0

finding arrays #include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; // Precompute all numbers 1..1000…

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Reddiwary Dhrutvan Reddy • 0

Median path: #include <bits/stdc++.h> using namespace std; void dfs(int node, int parent, vector<int>& val, vector&l…

Answer: GOOGLE OA | SWE Internship 2023 | Triangles | Maximize Collection | 22nd July (S by Nihal Reddy • 0

def solve_op(): t = int(input()) for _ in range(t): n = int(input()) costs = list(map(int, input().split())) …

Answer: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path by Nihal Reddy • 0

def merge_count_inversions(arr, temp, left, mid, right): i = left j = mid + 1 k = left inv_count = 0 while…

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Answer: Rubrik, Previously Asked Coding Questions

Answer: Oracle, SDE-1 Interview Experience, On-Campus Server-Tech, IIT-BHU, December, 20

Answer: Oracle, SDE-1 Interview Experience, On-Campus Server-Tech, IIT-BHU, December, 20

Amazon | SDE Intern | Interview Experience 1 | 2024

Answer: Media.net OA IIT Roorkee 29th September 2023

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

Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximum | Median Path | Prime Path

Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu

Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximum | Median Path | Prime Path

Answer: Nvidia, Recent Online Assessment Question | String Search | 2023

Recent Locations

Navi Mumbai, 57 minutes ago

Kanpur, 2 hours ago

Seattle, 6 hours ago

Hyderabad, 7 hours ago

Indore, 7 hours ago

Recent Awards • All

Good Question to Sakshi • 50

Commentator to Shubham Gupta • 30

Scholar to Vatsal Patel • 20

Great Question to mod2 870

Great Question to mod2 870

Great Question to John 1.0k

Great Question to Rohit • 670

Great Question to Rohit • 670

Great Question to Rohit • 670

Great Question to Rohit • 670