You are viewing a single comment's thread. Return to all comments →
Hey folks, I completed this problem by this solution, can anyone help me to analyse the time complexity for the below code,
function pangrams(s) { let splitQues = s.toLowerCase().split(" ").join("").split("").sort(); return splitQues.filter((item, pos) => splitQues.indexOf(item) === pos).length === 26 ? "pangram" : "not pangram"; }
Seems like cookies are disabled on this browser, please enable them to open this website
Pangrams
You are viewing a single comment's thread. Return to all comments →
Hey folks, I completed this problem by this solution, can anyone help me to analyse the time complexity for the below code,