ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Mind blowing solution.. so easy to understand thanks
Thanks and welcome
Amazing 🙌
coolest explaination
thanks Nalini
Well explained!
What will be time and space complexity ?
Is it .. Time : O(n) Space : O(n)Where n is the length of string Please correct me if I am wrong .
Here the interesting part is if you use String instead of StringBuilder you will get TLE xd.
Can be done using TreeMap or not ?
Solution in C++ : github.com/kirtan18/leetcode/blob/main/LeetCode%20Contests/Construct%20String%20With%20Repeat%20Limit.cpp
Mind blowing solution.. so easy to understand thanks
Thanks and welcome
Amazing 🙌
coolest explaination
thanks Nalini
Well explained!
What will be time and space complexity ?
Is it ..
Time : O(n)
Space : O(n)
Where n is the length of string
Please correct me if I am wrong .
Here the interesting part is if you use String instead of StringBuilder you will get TLE xd.
Can be done using TreeMap or not ?
Solution in C++ : github.com/kirtan18/leetcode/blob/main/LeetCode%20Contests/Construct%20String%20With%20Repeat%20Limit.cpp