Lascoux polynomials have been recently introduced to prove polynomiality of the maximum-likelihood degree of linear concentration models. We find the leading coefficient of the Lascoux polynomials (type C) and their generalizations to the case of general matrices (type A) and skew symmetric matrices (type D). In particular, we determine the degrees of such polynomials. As an application, we find the degree of the polynomial 8(m, n, n - s) of the algebraic degree of semidefinite programming, and when s =1 we find its leading coefficient for types C, A and D.