{"id":200,"date":"2019-12-13T09:49:12","date_gmt":"2019-12-13T09:49:12","guid":{"rendered":"https:\/\/www.samarthya.me\/wps\/?p=200"},"modified":"2019-12-13T09:49:12","modified_gmt":"2019-12-13T09:49:12","slug":"optimizing-in-js","status":"publish","type":"post","link":"https:\/\/blog.samarthya.me\/wps\/2019\/12\/13\/optimizing-in-js\/","title":{"rendered":"Optimizing in JS"},"content":{"rendered":"

\"Sonic<\/p>\n

You never stop learning is not just a phrase, it is something I live everyday. Today, I was just trying out my skills with JS and was solving an innocuous problem, in JS.<\/p>\n

\n

Pangram: A pangram is a sentence using every letter of the alphabet at least once.<\/p>\n

E.g. The quick brown fox jumps over the lazy dog.<\/p>\n<\/blockquote>\n

Like every old school programmer I was trying to solve it in the easiest of ways without breaking a sweat and the first version I could come up with was as under.<\/p>\n

\n
\/\/ Define an string of all Alphabets.\r\nexport const ALPHABETS = \"abcedfghijklmnopqrstuvwxyz\";\r\n\r\n\/\/ isPangram allows you input a string to be validated for Pangram\r\nexport const isPangram = (pangram) => {\r\n\r\n  if(pangram == null || pangram.length == 0) {\r\n\r\n    return false;\r\n\r\n  }\r\n\r\n  pangram = pangra.toLowerCase();\r\n\r\n  var x;\r\n\r\n  for (x in ALPHABETS){\r\n    if( pangram.indexOf(ALPHABETS[x]) >= 0) {\r\n      continue;\r\n    } else {\r\n      return false;\r\n    }\r\n  }\r\n  return true;\r\n};<\/pre>\n
So v1 was not much fat code,\u00a0 I was thinking but then the geek in me was trying to ask can it be simplified further? Optimized in a way it looks cool? and so started my struggle to better the version 1, I had just written.<\/p>\n<\/div>\n
Problem 1: How to generate the character set<\/h2>\n
So I thought, instead of having a simple constant string, how about I make it a function to first generate an Array that has all the characters from English; all from A … Z. (Some helpful link<\/a>)<\/p>\n
\n
Array.from({length: 26}, (_, i) => { String.fromCodeCode(97 + i)});<\/pre>\n
How I used it was like this.<\/p>\n
\n
const Alphabets = () => Array.from({length:26}, (_, i) =>String.fromCharCode(97+i));<\/pre>\n<\/div>\n
Now, after having this Array it was time to look for the ‘Pangram’ in the string. Another method every<\/em>()<\/a> and includes<\/a>() came to the rescue<\/a>.<\/p>\n
V2.0<\/h3>\n
\n
\/\/ isPangram allows you to look for Pangram.\r\nexport const isPangram = (pangram) => {\r\n     var alphabets = Alphabets();\r\n     var lowerCase = pangram.toLowerCase();\r\n     return alphabets.every( character=>lowerCase.includes(character));\r\n};<\/pre>\n<\/div>\n
and Voila, I think made a better version from what I had at v1.0.<\/p>\n<\/div>\n
– The – End –<\/h5>\n
\n
 <\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
You never stop learning is not just a phrase, it is something I live everyday. Today, I was just trying out my skills with JS and was solving an innocuous problem, in JS. Pangram: A pangram is a sentence using every letter of the alphabet at least once. E.g. The quick brown fox jumps over […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_exactmetrics_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":""},"categories":[1],"tags":[19,21,20],"class_list":["post-200","post","type-post","status-publish","format-standard","hentry","category-others","tag-js","tag-learn","tag-pangram"],"_links":{"self":[{"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/posts\/200","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/comments?post=200"}],"version-history":[{"count":0,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/posts\/200\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/media?parent=200"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/categories?post=200"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/tags?post=200"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}