Cut a note out of a magazine

def can_build_note(note, magazine):
    if len(note) > len(magazine):
        return False
    count = [0] * 26
    for ch in magazine:
        count[ord(ch) - 97] += 1
    for ch in note:
        k = ord(ch) - 97
        if count[k] == 0:
            return False            # the magazine has run out of this letter
        count[k] -= 1
    return True

#include <string>
using namespace std;

bool solve(const string& note, const string& magazine) {
    if (note.size() > magazine.size()) return false;
    int count[26] = {0};
    for (char ch : magazine) count[ch - 'a']++;
    for (char ch : note) {
        if (count[ch - 'a'] == 0) return false;   // the magazine has run out of this letter
        count[ch - 'a']--;
    }
    return true;
}

class Solution {
    public boolean canBuildNote(String note, String magazine) {
        if (note.length() > magazine.length()) return false;
        int[] count = new int[26];
        for (char ch : magazine.toCharArray()) count[ch - 'a']++;
        for (char ch : note.toCharArray()) {
            if (count[ch - 'a'] == 0) return false;   // the magazine has run out of this letter
            count[ch - 'a']--;
        }
        return true;
    }
}

function canBuildNote(note, magazine) {
  if (note.length > magazine.length) return false;
  const count = new Array(26).fill(0);
  for (const ch of magazine) count[ch.charCodeAt(0) - 97]++;
  for (const ch of note) {
    const k = ch.charCodeAt(0) - 97;
    if (count[k] === 0) return false;  // the magazine has run out of this letter
    count[k]--;
  }
  return true;
}

fn solve(note: &str, magazine: &str) -> bool {
    if note.len() > magazine.len() {
        return false;
    }
    let mut count = [0i32; 26];
    for b in magazine.bytes() {
        count[(b - b'a') as usize] += 1;
    }
    for b in note.bytes() {
        let k = (b - b'a') as usize;
        if count[k] == 0 {
            return false; // the magazine has run out of this letter
        }
        count[k] -= 1;
    }
    true
}

import qualified Data.Map.Strict as M

-- Count the magazine, then check that the note never needs more of a letter than the magazine has.
solve :: String -> String -> Bool
solve note magazine = and [M.findWithDefault 0 c have >= n | (c, n) <- M.toList need]
  where
    tally s = M.fromListWith (+) [(c, 1 :: Int) | c <- s]
    have = tally magazine
    need = tally note