TheJobOverflow

Request Recent Questions Now!

Showing : media.net • reset

21 Votes | 6 Replies

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

24 Votes | 4 Replies

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

4 Votes | 1 Reply

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

6 Votes | 1 Reply

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

2 Votes | 2 Replies

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

0 Votes | 1 Reply

on-campus online-test media.net

23 months ago

retarded_coder • 0

4 Votes | 0 Replies

media.net coding-round free-public-post

23 months ago

Delta 2.9k

5 Votes | 1 Reply

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

13 Votes | 3 Replies

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

33 Votes | 10 Replies

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

4 Votes | 3 Replies

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

5 Votes | 4 Replies

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

3 Votes | 4 Replies

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

9 Votes | 1 Reply

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

14 results • Page 1 of 1

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

Answer: Media.Net OA | XOR Subsequence | Help your Master 2 | Space Race 2025 | SRM | FT by Swagatika Rout • 0

#include <bits/stdc++.h> using namespace std; #define MOD 1000000007 #define pii pair<int,int> #define ll long long in…

Answer: Alphagrep | IIT Madras | OA | 2023 by Adarsh Maurya • 0

first of all we have to store the unique values in an array in sorted order , as we know ,the values which are same will follow the same pa…

Comment: Media.Net OA | Help Your Master| XOR Subsequences | Read Books nCdKd | IIIT Lu by Ansh Patel • 0

In Q2. We can use DP with states as dp[prev][xor_value] as boolean telling that is it possible to get xor_value with prev value... &…

Answer: Zomato, Recently Asked Questions in IITs, November, 2022 | Friends | The XOR Ope by Pankaj Kumar • 0

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

Answer: Goldman Sachs , Recent Online Assessment Questions | ASCII Encoded Strings | 20 by Hrishabh Patel • 0

#include<bits/stdc++.h> using namespace std; string decode(string &encoded){ string ans = ""; reverse(encoded.begin…

Answer: Goldman Sachs, Recent Online Assessment Questions | Encryption Validity | 2023 by Hrishabh Patel • 0

#include <bits/stdc++.h> using namespace std; vector<int> encryptionValidity(int instructionCount, int validityPeriod, in…

Answer: DE Shaw (DESIS Ascend) , Online Assessment Question (17th September 2023) | find by Shreyash Verma • 0

Solution using Binary Search on Answers #include <bits/stdc++.h> using namespace std; #define ll long lo…

Comment: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr by a aryan • 0

efficient simple way i store the val of each node in val array that i will get while backtracking and then check for no.of steps requ…

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

#include <bits/stdc++.h> using namespace std; void dfs(int v,int par,vector<int> &val,vector<vector<int>>…

Comment: Google | Complex Subsequence | Subtree XOR by .. • 0

#include <bits/stdc++.h> using namespace std; #define int long long int binexp(int n, int e, int m = 1000000007) { …

Comment: Google Interview Experience | 2023 Graduate Offcampus by Aditya Kumar • 0

void Spidycoder() { string s; cin >> s; int n = s.size(); int q; cin >> q; vector> v; for (int i = 0; i < q; i+…

Answer: Google | OA | 2022 | Balanced brackets | Maximize equal numbers | Diagonal numbe by Sourav Mohapatra • 0

Problem 1: <code> #include <bits/stdc++.h> using namespace std; using ll = long long; void solve() { &n…

Answer: Atlassian , Recent Online Assessment Questions( 21st August 2023) | Ride Hailing by Sourav Mohapatra • 0

This is the solution for question 3 if anyone wants #include <bits/stdc++.h> using namespace std; using ll = long long; int m…

Answer: Irage , Online Assessment (IIT Kanpur) | Look and You shall Find | Logistics Cen by Abhijeet Kumar • 0

Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Madhavi Unnam • 0

Na

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

Media.Net OA | XOR Subsequence | Help your Master 2 | Space Race 2025 | SRM | FTE | 1st August 2023

Media.Net OA | Help Your Master| XOR Subsequences | Read Books nCdKd | IIIT Lucknow | 25th July 2023

Answer: Google | Complex Subsequence | Subtree XOR

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

AlgoUniversity Technology Fellowship: Stage 2 || Important Questions

Goldman Sachs, Recent Online Assessment Questions | Encryption Validity | 2023

Answer: Juspay | 21st October | Online Assessments | Locking the tree of space

Media.net OA IIT Roorkee 29th September 2023

Google | Complex Subsequence | Subtree XOR

Answer: Oracle | 13th October | Online Assessments

Recent Locations

Delhi, 21 minutes ago

Brussels, 26 minutes ago

Bengaluru, 1 hour ago

New Delhi, 1 hour ago

Newcastle upon Tyne, 2 hours ago

Recent Awards • All

Appreciated to admin 1.7k

Great Question to John 940

Great Question to John 940

Great Question to admin 1.7k

Great Question to xINFERNOx • 40

Appreciated to PoGo 2.4k

Appreciated to PoGo 2.4k

Great Question to PoGo 2.4k

Great Question to PoGo 2.4k

Great Question to PoGo 2.4k