Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

a_journey's blog

By a_journey, history, 2 months ago, In English,

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.

Read more »

 
 
 
 
  • Vote: I like it
  • -23
  • Vote: I do not like it

By a_journey, history, 5 months ago, In English,

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.

Read more »

 
 
 
 
  • Vote: I like it
  • -19
  • Vote: I do not like it

By a_journey, history, 6 months ago, In English,

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.

Read more »

 
 
 
 
  • Vote: I like it
  • -21
  • Vote: I do not like it

By a_journey, history, 7 months ago, In English,

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.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By a_journey, history, 8 months ago, In English,

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

What happened to atcoder ?

rng_58, chokudai, snuke, UnstoppableSolveMachine.

Read more »

 
 
 
 
  • Vote: I like it
  • +11
  • Vote: I do not like it

By a_journey, history, 11 months ago, In English,

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 .

Read more »

 
 
 
 
  • Vote: I like it
  • -1
  • Vote: I do not like it

By a_journey, history, 12 months ago, In English,

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

Here is the link

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By a_journey, history, 12 months ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it
  • +9
  • Vote: I do not like it

By a_journey, history, 13 months ago, In English,

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 !

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By a_journey, history, 13 months ago, In English,

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 !

Read more »

 
 
 
 
  • Vote: I like it
  • -13
  • Vote: I do not like it