| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
Current Exp: 6 months Current Pos: SDE-1
I have a machine coding round at Swiggy for SDE-1 position, could anyone here brief me what difficulty level can I expect keeping in mind my 6 months exp? Are we allowed to code on our IDE? Are we allowed to make a google search to find some syntax online? I couldn't find much on the internet, any help would be much appreciated and please suggest some good resources to practice machine coding round. Thank you
double lhs=y*log10(x); double rhs=x*log10(y);
**
double lhs=log10(x); double rhs=log10(y); lhs*=y; rhs*=x;
I am getting wrong answers for x=6,y=6 while submitting on codeforces but I am getting correct on VSCode.
Are you guys still using a20j ladder? which has pretty old problems and also the difficulty level has also increased if compare old contest with new contests. Is it still a good idea to go with a20j or anyone have updated ladders? Please, someone, enlighten me.
Has anyone gone through WorkIndia on-campus hiring placements? Like what was the difficulty of the questions asked and everything else?
Input format: [queue], [group size] input : 4 5 3 2 5 6 7 1, 3 output: 3 5 4 6 5 2 1 7
I know how to reverse a queue without using extra space but I am quite stuck here. Any help would be much appreciated?
Could anyone please explain to me how to solve this dp problem? Link:https://atcoder.jp/contests/dp/tasks/dp_p Please help?
Could anyone please explain to me how to solve this dp problem? Link:https://atcoder.jp/contests/dp/tasks/dp_o Please help?
Could anyone please exlain me how to solve this dp problem? Link:https://atcoder.jp/contests/dp/tasks/dp_n Help?
