Sort by

recency

|

2752 Discussions

|

  • + 1 comment

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/tRUU2pSf8fI

    int designerPdfViewer(vector<int> h, string word) {
        int mx = 0;
        for(int el : word) if(h[el - 'a'] > mx) mx = h[el - 'a'];
        return mx * 1 * word.size();
    }
    
  • + 0 comments

    "WTF. I created a monster =) "What have I created?!""

    int designerPdfViewer(vector h, string word) { int len = word.size(); vector gg;

    char maxac = 'a';
    for (int i = 0; i < len; i++) {
        if (maxac < word[i]) {
            maxac = word[i];
        }
    }
    
    string pp = "abcdefghijklmnopqrstuvwxyz";
    int chet = 0;
    char bb = 'a';
    int hp;
    
    for (int i = 0; i < h.size(); i++) {
        if (bb == maxac) {
            gg.push_back(h[i]);
            sort(gg.begin(), gg.end());
    
            hp = len * gg[gg.size() - 1];
            break;
        }
        else {
            bb++;
            gg.push_back(h[i]);
        }
    }
    return hp;
    

    }

  • + 0 comments

    def designerPdfViewer(h, word): a = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'] letters_height=[] word=list(word) for i in range(len(word)): for j in range(len(a)): if word[i]==a[j]: letters_height.append(h[j]) return max(letters_height)*len(word)

  • + 0 comments

    def designerPdfViewer(h, word):

    a = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
    letters_height=[]
    
    word=list(word)
    for i in range(len(word)):
        for j in range(len(a)):
            if word[i]==a[j]:
                letters_height.append(h[j])
    return max(letters_height)*len(word)
    
  • + 0 comments

    def designerPdfViewer(h, word):

    a = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
    letters_height=[]
    
    word=list(word)
    
    for i in range(len(word)):
        for j in range(len(a)):
            if word[i]==a[j]:
                letters_height.append(h[j])
    return max(letters_height)*len(word)