New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Time Complexity : O(n^2) #4

Open

JadeKim042386 opened this issue Sep 28, 2021 · 0 comments

Contributor

JadeKim042386 commented Sep 28, 2021

CodingStudy/뉴스 클러스터링/sehwa.py

Lines 23 to 26 in 9ed8106

    
           for char in str1 : 
        
               if char in str2: 
        
                   union.remove(char) 
        
                   str2.remove(char)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment