TheJobOverflow

Request Recent Questions Now!

Showing : free-public-post • reset

2 Votes | 1 Reply

free-public-post MentorGraphics interview Mentor on-campus

6 Votes | 3 Replies

bhanzu free-public-post coding-round

4 Votes | 1 Reply

interview on-campus free-public-post accenture

6 Votes | 1 Reply

interview free-public-post google

7 Votes | 0 Replies

free-public-post interview goldmansachs on-campus

15 months ago

shahinmansoori28 • 70

5 Votes | 0 Replies

publicis-sapient on-campus free-public-post interview

3.0 years ago

Aman Kishore • 50

2 Votes | 2 Replies

on-campus interview free-public-post adobe

3 Votes | 2 Replies

sde on-campus interview visa free-public-post

3.0 years ago

mscode054 • 30

4 Votes | 1 Reply

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

1 Vote | 0 Replies

free-public-post interview on-campus Deutsche-Bank

3 Votes | 1 Reply

Morgan-Stanley IITs on-campus free-public-post

2 Votes | 3 Replies

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

1 Vote | 1 Reply

interview Dassault-Systems free-public-post

2 Votes | 2 Replies

intern goldmansachs free-public-post OAs

10 Votes | 4 Replies

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

5 Votes | 6 Replies

free-public-post Qualcomm interview coding-round

6 Votes | 4 Replies

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

2 Votes | 2 Replies

free-public-post IITs coding-round on-campus Pine-Labs

1 Vote | 1 Reply

Dassault-Systems interview free-public-post

4 Votes | 2 Replies

CITI product free-public-post

3 Votes | 3 Replies

jpmc JP-Morgan IITs free-public-post

4 Votes | 2 Replies

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

2 Votes | 3 Replies

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

4 Votes | 5 Replies

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

7 Votes | 3 Replies

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

6 Votes | 7 Replies

product free-public-post paytm OAs coding-round

10 Votes | 3 Replies

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

9 Votes | 4 Replies

on-campus free-public-post OA flipkart IIT

2 Votes | 2 Replies

free-public-post JP-Morgan jpmc coding-round on-campus

10 Votes | 7 Replies

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

0 Votes | 1 Reply

cred product job free-public-post OAs

3 Votes | 2 Replies

free-public-post audify-tech coding-round on-campus product

6 Votes | 3 Replies

tiktok product free-public-post OAs coding-round

7 Votes | 2 Replies

hilabs product on-campus free-public-post

1 Vote | 3 Replies

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

6 Votes | 4 Replies

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

7 Votes | 4 Replies

product free-public-post sprinklr OAs coding-round

0 Votes | 2 Replies

product on-campus IITs free-public-post intel

0 Votes | 2 Replies

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

4 Votes | 4 Replies

free-public-post Jio product on-campus

609 results • Page 12 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

Nagpur, 2 hours ago

Lucknow, 3 hours ago

Hyderabad, 7 hours ago

Raipur, 13 hours ago

Gurugram, 13 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