TheJobOverflow

Request Recent Questions Now!

24 Votes | 13 Replies

algouniversity_technology_fellowship free-public-post

50 Votes | 14 Replies

trilogy-innovations codenation OA off-campus free-public-post

24 Votes | 6 Replies

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

49 Votes | 14 Replies

free-public-post product interview Flipkart coding-round

12 Votes | 4 Replies

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

13 Votes | 5 Replies

Online-Assessments microsoft job coding-round

7 Votes | 2 Replies

coding-round standard-chartered on-campus

1 Vote | 0 Replies

media.net oa Goat mnit

11 weeks ago

Alok kumar • 10

2 Votes | 2 Replies

off-campus Permutation

10 Votes | 5 Replies

JP-Morgan OAs product

0 Votes | 0 Replies

Cepheid OA sde solution off-campus

3 months ago

Abhijit Mishra • 20

10 Votes | 6 Replies

free-public-post Product Oracle OAs coding-round

0 Votes | 0 Replies

7 months ago

Varun Reddy • 0

14 Votes | 10 Replies

sde oa free-public-post coding-round hilabs

0 Votes | 0 Replies

sde interview john-deere sde1

7 months ago

Nishant Agarwal • 0

4 Votes | 2 Replies

on-campus OAs product free-public-post walmart

0 Votes | 0 Replies

sde interview infineon sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde interview infineon sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde interview infineon sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde interview infineon sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde hugosave interview sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde interview hp sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

hilabs sde interview sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

frontend sde groww sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde groww interview sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

grey-orange sde interview sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde genpact data-scientist sde1

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

interview data-analyst ey

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

consultant interview ey

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 sde devrev interview

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

internship deutsche-bank tdi interview

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

internship deutsche-bank tdi interview

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

deltax product-engineer interview

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

deltax product-engineer interview

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

deltax product-engineer interview

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

deltax product-engineer interview

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 sde decimal-point-analytics

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

sde1 sde interview decimal-point-analytics

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

data-scientist decimalpointanalytics interview

7 months ago

Nishant Agarwal • 0

0 Votes | 0 Replies

dassaults sde1 sde interview

7 months ago

Nishant Agarwal • 0

1,111 results • Page 1 of 28

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

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…

Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr by Nihal Reddy • 0

from collections import defaultdict, deque def getMinOperations(gnodes, kap, edges): adj = defaultdict(list) for u, v in edg…

Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr by Nihal Reddy • 0

def getSmallestSortedArray(arr): n = len(arr) sarr = [str(x) for x in arr] res = [""] * n # last element res[-…

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

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

How to get Premium Access?

Answer: Uber OA (on campus) | 6 Month Intern

AlgoUniversity Technology Fellowship: Stage 2 || Important Questions

PhonePe | 9th October | Online Assessments

Answer: Question from my last OA, Infeneon

Answer: Question from my last OA, Infeneon

Recent Locations

Meerut, 43 minutes ago

Mandi, 1 hour ago

Hyderabad, 5 hours ago

Guwahati, 6 hours ago

Varanasi, 6 hours ago

Recent Awards • All

Great Question to John 1.0k

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to Rohit • 660

Great Question to John 1.0k

Popular Question to pillaisamarth • 30