Watch Part One: ruclips.net/video/DCoIeGt4g7M/видео.html Question link: devtools.tech/questions/s/how-to-create-an-interactive-shape-based-ui-uber-frontend-interview-question-or-javascript-or-react-js---qid---6FVH1ZMWMXd4uZ8WAGEi Support us: topmate.io/yomeshgupta/748345 Practice with us: topmate.io/yomeshgupta
Hey! I remember commenting about the how this was kinda hard coded and would be nice for it to be dynamic. Happy to see you address those points in the follow video. As always great content!
Hey, thanks for your suggestions on the last video. I always try to accommodate suggestions and constructive criticism I receive on the videos. Glad to see you liked my content! 🙌🏼
There is no trade-off here. While flattening the array results in a time complexity of O(N), the N is different from that in the row and column approach. In the row and column approach, the time complexity is O(N^2), but the number of iterations is equivalent for both methods for any given matrix. This is because, for a flattened array, N = sqrt(N in the row-column approach).
![[DRAGON BALL LEGENDS REVEALS ＆ STUFF] LEGENDS FESTIVAL 2024 Special Edition Part 2](http://i.ytimg.com/vi/af0phKxitX8/mqdefault.jpg)
Watch Part One: ruclips.net/video/DCoIeGt4g7M/видео.html
Question link: devtools.tech/questions/s/how-to-create-an-interactive-shape-based-ui-uber-frontend-interview-question-or-javascript-or-react-js---qid---6FVH1ZMWMXd4uZ8WAGEi
Support us: topmate.io/yomeshgupta/748345
Practice with us: topmate.io/yomeshgupta
Hey! I remember commenting about the how this was kinda hard coded and would be nice for it to be dynamic. Happy to see you address those points in the follow video. As always great content!
Hey, thanks for your suggestions on the last video. I always try to accommodate suggestions and constructive criticism I receive on the videos. Glad to see you liked my content! 🙌🏼
Thanks alot
It was very usefull
Glad to hear that!
amazing content...can you bring some good projects video please
What do you want to know in project videos? Do you want me to talk about project ideas? Build one? Code structure? Please elaborate.
There is no trade-off here.
While flattening the array results in a time complexity of O(N), the N is different from that in the row and column approach. In the row and column approach, the time complexity is O(N^2), but the number of iterations is equivalent for both methods for any given matrix. This is because, for a flattened array, N = sqrt(N in the row-column approach).
Tradeoff not in terms of time complexity but flattening the array approach is rigid in terms of UI.
Bro kabhi smile bhi kar dia kar, Itna serious lagta hai, darr lagta kahi screen se nikal kar pitai na kar de
Hahah bro I agree but kya kare thoda recording time pe serious sa ho jata hai. 😅