We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new have a smaller field size requirement compared with known constructions. For certain asymptotic regimes, the constructed order-optimal alphabet size, asymptotically matching lower bound.