JobOverflow

80 results • Page 1 of 2

Showing : coding-round • reset

4 Votes | 2 Replies

coding-round amazon on-campus

• updated 1 day ago

aditya.aggarwal393 • 0

1 Vote | 0 Replies

amazon on-campus coding-round

6 days ago

papa • 260

7 Votes | 2 Replies

sprinklr coding-round on-campus

• updated 1 day ago

mod2 • 760

0 Votes | 0 Replies

uber coding-round on-campus

7 days ago

papa • 260

0 Votes | 0 Replies

deshaw coding-round

7 days ago

papa • 260

7 Votes | 3 Replies

microsoft coding-round on-campus

• updated 6 days ago

admin 690

0 Votes | 0 Replies

sprinklr coding-round

• updated 7 days ago

admin 690

1 Vote | 0 Replies

cred on-campus coding-round

15 days ago

luckyjain1271 • 30

4 Votes | 2 Replies

off-campus google coding-round

• updated 14 days ago

Raghavendra • 30

1 Vote | 2 Replies

coding-round

• updated 4 weeks ago

Gigaliths • 90

2 Votes | 0 Replies

codenation coding-round

• updated 5 weeks ago

admin 690

3 Votes | 0 Replies

coding-round free-public-post coderush

3 months ago

admin 690

2 Votes | 0 Replies

Coderush coding-round

• updated 5 months ago

admin 690

2 Votes | 0 Replies

off-campus coding-round sde

9 months ago

Viren Khatri • 50

4 Votes | 0 Replies

mathworks coding-round

• updated 8 days ago

admin 690

1 Vote | 2 Replies

coding-round bytedance

• updated 9 months ago

garg.6 • 40

3 Votes | 1 Reply

singapore coding-round bytedance sde1

• updated 9 months ago

garg.6 • 40

0 Votes | 0 Replies

coding-round bytedance singapore

10 months ago

papa • 260

0 Votes | 7 Replies

coding-round bytedance

• updated 10 months ago

haxor • 0

0 Votes | 0 Replies

graviton coding-round coding

• updated 10 months ago

admin 690

0 Votes | 0 Replies

coding-round coding intern uber

11 months ago

saitama_26 • 20

4 Votes | 6 Replies

intern coding-round on-campus codenation

• updated 11 months ago

megatron123 • 30

0 Votes | 0 Replies

coding-round codenation

• updated 11 months ago

admin 690

1 Vote | 0 Replies

coding-round on-campus atlassian

12 months ago

admin 690

1 Vote | 0 Replies

DBOI coding-round on-campus intern

12 months ago

saitama_26 • 20

4 Votes | 4 Replies

coding-round google

• updated 4 weeks ago

prakhar12dubey • 50

0 Votes | 1 Reply

coding-round google

• updated 12 months ago

priyanka.36 90

0 Votes | 1 Reply

coding-round google

• updated 12 months ago

priyanka.36 90

1 Vote | 6 Replies

coding-round google priyanka.36

• updated 12 months ago

saitama_26 • 20

4 Votes | 3 Replies

coding-round google

• updated 12 months ago

priyanka.36 90

8 Votes | 9 Replies

coding-round google

• updated 12 months ago

priyanka.36 90

4 Votes | 5 Replies

gocc coding-round google

• updated 12 months ago

pathetic_puma • 30

0 Votes | 2 Replies

gocc coding-round google

12 months ago

mod2 • 760

0 Votes | 1 Reply

gocc coding-round google

12 months ago

mod2 • 760

0 Votes | 1 Reply

gocc coding-round google

12 months ago

mod2 • 760

2 Votes | 3 Replies

coding-round google GOCC

12 months ago

mod2 • 760

1 Vote | 1 Reply

sde coding-round alphagrep python-developer

• updated 14 months ago

papa • 260

2 Votes | 0 Replies

sde1 coding-round

15 months ago

papa • 260

4 Votes | 1 Reply

sde coding-round off-campus dealshare

16 months ago

admin 690

0 Votes | 1 Reply

coding-round ByteDance

• updated 9 months ago

garg.6 • 40

80 results • Page 1 of 2

Recent Votes

Amazon OA - Set 3 - Oncampus 2022

Oracle - Member of Technical Staff - OnCampus (2022)

Wells Fargo 2022 Full Time Hiring

Oracle - Member of Technical Staff - OnCampus (2022)

Oracle - Member of Technical Staff - OnCampus (2022)

Wells Fargo 2022 Full Time Hiring

Answer: Sprinklr Coding Round Oncampus 2022

Answer: Sprinklr Coding Round Oncampus 2022

Answer: Sprinklr Coding Round Oncampus 2022

Comment: Sprinklr Coding Round Oncampus 2022

Company Tags

Recent Locations • All

India/Pune, 4 days ago

delhi, 26 days ago

Gaya, 5 weeks ago

India, 3 months ago

IIIT Naya Raipur, 5 months ago

Recent Awards • All

Scholar to Gigaliths • 90

Teacher to Gigaliths • 90

Scholar to garg.6 • 40

Teacher to garg.6 • 40

Teacher to Viren Khatri • 50

Centurion to mod2 • 760

Commentator to admin 690

Popular Question to admin 690

Scholar to mrinal.shashwat • 30

Teacher to mrinal.shashwat • 30

Recent Replies

Answer: Amazon OA - Set 3 - Oncampus 2022 by aditya.aggarwal393 • 0

Was this for Intern or Full Time?

Comment: Sprinklr Coding Round Oncampus 2022 by mod2 • 760

**Quick Solution Sketches** *Problem 1* There are multiple ways to solve this. One approach is to mantain sliding window and do basic coun…

Answer: Sprinklr Coding Round Oncampus 2022 by Gigaliths • 90

Problem 3 > Observation 1 : There are roughly 25 prime numbers between 2-100. > Observation 2 : Each node can choose any of these 2…

Answer: Amazon OA - Set 3 - Oncampus 2022 by srijansriv • 0

the last question is very clear maybe because its unconventional (or incomplete). could you please elaborate, thanks!

Comment: Microsoft Coding Round Oncampus - 2022 by admin 690

Both, the idea and code is neat!

Answer: Microsoft Coding Round Oncampus - 2022 by mod2 • 760

<h3>Solution 1</h3> <b>Number of subarrays with average = K</b> <pre> Educational Tip (AVERAGE-TRICK) For a lot of problems involving 'ave…

Answer: Microsoft Coding Round Oncampus - 2022 by mod2 • 760

Problem 1 --------- **Number of subarrays with average = K** Educational Tip (AVERAGE-TRICK) For a lot of problems involving 'av…

Answer: Google Online Coding Challenge 23rd July by Raghavendra • 30

The Question is a variation of pick not pick pattern[DP](Here pick means choose first element and non-pick means choose second element). …

Answer: Google Online Coding Challenge 23rd July by Raghavendra • 30

The Question is a variation of pick not pick pattern[DP](Here pick means choose first element and non-pick means choose second element). …

Answer: Microsoft Online Test by Gigaliths • 90

let sum(X) denote subarray sum from [0...X]<br> we need to find pairs [L,R] such that sum[R] - sum[L-1] = (R-L+1)*k.<br> This g…

Answer: BloomReach - SDE 1 ( 1 year Exp ) - Coding Round by Gigaliths • 90

For problem 2 Let dp(i) denote the number of valid subsequences possible of type "abc....s[i]" from [ 0 , i ] It is fairly clear that…

Answer: Question: Google | Coding Round (GOCC) - Set2 | July 2021 GOCC coding-round goog by prakhar12dubey • 50

int solve(vector<vector<int>> &mat){ int m = mat.size(), n = mat[0].size(); int ans = 0; for(int i = m-2; i >= 0; i--)…

Comment: BloomReach - SDE 1 ( 1 year Exp ) - Coding Round by mod2 • 760

Problem 2 is exactly same problem that Manas sir taught in his depth session on <b>Subsequence DP</b>!!

Answer: ByteDance | Singapore | SDE Intern | Freshers | 2nd October 2021 singapore sde1 by garg.6 • 40

def helper(n,dp,kMax): if(dp[n]!=-1): return dp[n] if(n <= 2*kMax): return 1 for i…

Comment: Assessment for Backend Engineer (Growth)-2021 Start - ByteDance Campus Recruitme by garg.6 • 40

Question2 : https://leetcode.com/problems/count-binary-substrings/submissions/