@@kashyapKbandi yup I know these, I was talking about how he does debug and also he has already written so many custom function even before starting. So I wish there would be video anywhere explaining writing important functions and type defs.
I don't know how he test and debug but there is a command line application called "cpbooster". We can download test cases, test and debug etc. Very nice tool. As I am using Neovim I can directly test and debug within NeoVIM
This is core algo from Gennady's problem 2. for (int i = 1; i < MAX; i++) { for (int j = 2 * i + 1; j < MAX; j += i) { dp[j] = max(dp[j], dp[i] + 1); } } Could you explain why it's j = 2 * i + 1 instead of j = 2 * i ?
@@letscode-it881 Your reply makes no sense. But nvm after an hour of thinking I figured it out. It's a very subtle dp transition. y = 1 + kx . Because a_(i+1) = k a_(i), k is integer, the terms after 1 must have a common divisor.
Your videos are great!!
Neal, can you please make a video about your CP setup?
🧐
Hey, can you please share your bash script that runs and test solutions.
Even I want it
what keyboard do you have?
Setup video please
Anyone can recommend me a video for having this kind of ide and code template setup pls?
IDE is Sublime. and the code is c++ . Not sure of the template though.
@@kashyapKbandi yup I know these, I was talking about how he does debug and also he has already written so many custom function even before starting. So I wish there would be video anywhere explaining writing important functions and type defs.
@@aniketkumarpathak4630 i have the saem doubt,if u ever find please reply to this
I don't know how he test and debug but there is a command line application called "cpbooster". We can download test cases, test and debug etc. Very nice tool. As I am using Neovim I can directly test and debug within NeoVIM
@@aniketkumarpathak4630 you get this over time
This is core algo from Gennady's problem 2.
for (int i = 1; i < MAX; i++) {
for (int j = 2 * i + 1; j < MAX; j += i) {
dp[j] = max(dp[j], dp[i] + 1);
}
}
Could you explain why it's j = 2 * i + 1 instead of j = 2 * i ?
Because if you move down by one step , you have to add two to its left value
@@letscode-it881 Your reply makes no sense. But nvm after an hour of thinking I figured it out. It's a very subtle dp transition. y = 1 + kx . Because a_(i+1) = k a_(i), k is integer, the terms after 1 must have a common divisor.
@@abc-by1kb try to make a 2d matrix and do dry run. You will get to know my reply make sense or not
what is the type of ur keyboard;
Mechanical keyboard
@@letscode-it881 the name of it.
@@muhammadghareeb399 microsoft ergonomic keyboard 4000
Please share your templates with us.🙏🏼
You can get the template from cf
Awesome man !!!
I should not say it. But change your dp😂
It looks bad