We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Designer PDF Viewer
  5. Discussions

Designer PDF Viewer

  • ashsingh1
     + 1 comment
    int highlightedRect(String string, int[] heights){
        char[] chars = string.toCharArray();
        int maxH = -1;
        for(char a: chars){
            maxH = Math.max(heights[a - 'a'], maxH);
        }

        return maxH * string.length();

    }

    A really small code for this problem. A hashmap would only increase the space complexity