A string S consisting of N characters is considered to be properly nested if any of the following conditions is true:S is empty;S has the form '(U)' or "[U]" or "{U}" where U is a properly nested string;S has the form "VW" where V and W are properly nested [login to view URL] example, the string "{[()()]}" is properly nested but "([)()]" is [login to view URL] a function:object Solution { def solution(S: String): Int }that, given a string S consisting of N characters, returns 1 if S is properly nested and 0 [login to view URL] example, given S = "{[()()]}", the function should return 1 and given S = "([)()]", the function should return 0, as explained [login to view URL] that:N is an integer within the range [0..200,000];string S consists only of the following characters: "(", "{", "[", "]", "}" and/or ")".Complexity:expected worst-case time complexity is O(N);expected worst-case space complexity is O(N) (not counting the storage required for input arguments).*/}
Hello
I am Python expert and interested in this project. I have reviewed the details and confident to handle the project perfectly.
Please communicate to discuss further.
Regards
Anshu
Hi,
I have done several projects similar with this.
Please view my portfolios and contact me to discuss your project.
Let me know the details via interview.
Thank you.
Regards,
Hi
I am algorithm expert and can get the code done for you in the complexity you need .
can write well documented code which would be easy to explain
Thanks
Aditya
I have ~7 years of experience in C/C++ and over 3 in C#. I also write some Python code and recently Haskell, so I can do the task easily.
Please contact me to discuss the details.