ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
very good explanation, Recursion and backtracking approach is like hell, I thought you would solve using backtracking. Anyway good solution
Understood, very interesting question and looks like you have in brute force manner
Thanks for great explanation
Try for this if error is coming bool check(string &st){ int n = st.size(); if (n 3){ return false; } if (st[0] == '0' && n > 1){ return false; } int p; try { p = stoi(st); } catch (const std::invalid_argument& e) { std::cerr
Thnx
Can it be more optimised?
very nice explanation
Explanation is super fast which is a bit confusing
hey rakesh you can watch it at 0.75x if you feel its a bit fast for you
explanation was very bad
Tuze ata hai kya itna to🤣🤣
very good explanation, Recursion and backtracking approach is like hell, I thought you would solve using backtracking. Anyway good solution
Understood, very interesting question and looks like you have in brute force manner
Thanks for great explanation
Try for this if error is coming
bool check(string &st){
int n = st.size();
if (n 3){
return false;
}
if (st[0] == '0' && n > 1){
return false;
}
int p;
try {
p = stoi(st);
} catch (const std::invalid_argument& e) {
std::cerr
Thnx
Can it be more optimised?
very nice explanation
Explanation is super fast which is a bit confusing
hey rakesh you can watch it at 0.75x if you feel its a bit fast for you
explanation was very bad
Tuze ata hai kya itna to🤣🤣