TheJobOverflow

Request Recent Questions Now!

Showing : deshaw • reset

3 Votes | 3 Replies

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

12 Votes | 3 Replies

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

0 Votes | 1 Reply

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

8 Votes | 4 Replies

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

9 Votes | 3 Replies

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

1 Vote | 1 Reply

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

5 Votes | 6 Replies

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

8 Votes | 7 Replies

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

0 Votes | 0 Replies

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

4 Votes | 2 Replies

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

6 Votes | 2 Replies

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

0 Votes | 0 Replies

free-public-post deshaw coding-round

14 Votes | 9 Replies

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

2 Votes | 0 Replies

Internship DeShaw free-public-post Interview

2 Votes | 0 Replies

free-public-post Intern coding-round deshaw OA

2 Votes | 1 Reply

deshaw coding-round

16 results • Page 1 of 1

Request Recent Questions Now!

Filter Posts by Company

Recent Replies

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

Answer: Flipkart | October, 2022 | Interview Questions by Aman Singh Budhala • 0

Easiest solution for question 4=> #include<bits/stdc++.h> using namespace std; int32_t main(){ ios_base::syn…

Answer: Flipkart | October, 2022 | Interview Questions by Aman Singh Budhala • 0

Code for Question 3: It's a standard graph problem #include<bits/stdc++.h> using namespace std; #define mod 1000000007 …

Answer: Chargebee | 29 Sept | Internship | Online Assessments by Aditya Kumar • 0

I am trying to solve it using Brute Force Approach.Any optimised approach is appreciable. void Spidycoder() { int n, m…

Answer: DE Shaw, Online Assesment (DESIS | 17th September 2023) | Range Selection | GetM by Vakkalanka Ram Charan • 0

Q1) void solve() { string s; int k; cin >> s >> k; ve…

Comment: Uber OA | NSUT | 17 July 2023 by Sam • 0

#include<bits/stdc++.h> using namespace std; int findPath(vector<vector<pair<int, int>>> &adj, vector<in…

Answer: Amazon Hackon coding round problem | Character Traversal | Lamp and Houses by priyam169 • 10

Problem 2 : USING BINARY SEARCH INTUITION: Monotonous , Since if with distance k , every house can be lighted then wit…

Answer: Navi OA by Yuvraj singh Kanoujia • 0

I have a doubt in this problem as this same problem is also present in the leetcode Link:-Problem Link But the solution that …

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now

Top Problem Solvers

Claim your TJO hamper 🎁

Recent Votes

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

Answer: Oracle | 13th October | Online Assessments

Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr

Comment: DE SHAW | February 2023 | Online Assessments

De Shaw Internship Interview Experience

Sprinklr , Recent Online Assessment (NIT karnataka , FTE) | Weird Test | Division Nodes | Computer Lab | 2023

Sprinklr , Recent Online Assessment (NIT karnataka , FTE) | Weird Test | Division Nodes | Computer Lab | 2023

Recent Locations

Bengaluru, 2 minutes ago

Patna, 2 minutes ago

Lucknow, 13 minutes ago

Hyderabad, 30 minutes ago

Faridabad, 1 hour ago

Recent Awards • All

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

Great Question to PoGo 2.4k