I find codeforces problems with rating 1900 easier than LC medium hard..

Does anyone else feel that leetcode medium hard problem or LC contest problem 3 is tougher than codeforces with problem rating 1700 or div2C, or only i feels it.

# | User | Rating |
---|---|---|

1 | tourist | 3687 |

2 | ecnerwala | 3668 |

3 | Benq | 3503 |

4 | ksun48 | 3421 |

5 | Um_nik | 3412 |

6 | Radewoosh | 3382 |

7 | maroonrk | 3323 |

8 | ainta | 3318 |

9 | Itst | 3239 |

10 | apiadu | 3238 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 204 |

2 | SecondThread | 200 |

3 | Monogon | 196 |

4 | vovuh | 189 |

5 | Um_nik | 186 |

6 | pikmike | 185 |

7 | antontrygubO_o | 184 |

8 | Ashishgup | 181 |

9 | pashka | 169 |

10 | Radewoosh | 167 |

I find codeforces problems with rating 1900 easier than LC medium hard..

Does anyone else feel that leetcode medium hard problem or LC contest problem 3 is tougher than codeforces with problem rating 1700 or div2C, or only i feels it.

HELLO! If anyone has any prior experience of interview at mnc's like google and facebook. which one should I go for. leetcode medium or leetcode hard.

How much should I solve from each level. Along with it which sources are best for google and fb interviews for SDE 1 entry position

Any help would be appreciated. thanks.

HELLO! If anyone has any prior experience of interview at mnc's like google. which one should I go for. leetcode medium or leetcode hard.

How much should I solve from each level. Along with it which sources are best for google and fb interviews for SDE 1 entry position

Any help would be appreciated. thanks.

Here is the problem.

And here is one of the AC solution : http://codeforces.com/contest/999/submission/39534469 which is based on how to distribute M cards among N persons optimally such that joy is maximum. But how will we take care of this case : Suppose there are 3 players whose favourite card is say x and it occurs 5 times.

suppose p1 get 2 card , p2 = 2 , p3 = 1 and they want to have 4 cards in total.

Now how to select the remaining cards for them, since suppose if i give number y to player 1 it can be the favourite for some other player which will decrease his joy and may affect total joy.

Why no test cases are uploaded for the recent atcoder beginner and regular rounds ?

What happened to atcoder ?

when we do while(low < high )

suppose i get answer at mid =( low + high ) / 2 ;

if i again set low to mid , then there is a possibility that it will go in infinite loop .

for example :

low = 4 , high = 5 mid = 4

now suppose if mid is true and we again set low = mid , then low will be again 4 and it will go into infinite loop . what to do in that case , should we set low = mid + 1 .

how to decide when to set low = mid and when low = mid + 1 .

How can i check scoreboard and number of submission and solution from years 2018 onwards. whenever i try to open page there is no scoreboaed and other solution i can see..

an anyone tell me what to do

How good are hackerearth segment tree probelms . ?

has anyone solved them , how are they , i stuck on ST problems , so i want to choose some best practice platform for it . is it good ?> any suggestions

*Given an array a[] = {1, 1 ,1 , -1} . you have to find all the subarrays of the given array whose sum is exactly =* k.

example : a[] = { 1 , 1 , 1 , -1 } and k = 1

Ans = 4 all 3 one's + range from [2,4]

There is an geeks_article for it but the explanation is not good and clear and also without proof .

Can anyone explain me how to solve this problem with some explanation !

Thanks !

**Hello , community Can you provide me some of the very good division 2 rounds on codeforces ! which taught you many great things or which had highly intutive and tricky problems !** ****__ i m trying to practice contest wise , but couldn't choose which contest to participate ! as there may be some contest which are not so good but there also which are best !

please tell !

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/30/2020 21:03:43 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|