Solution to Longest-Password by codility

5 Replies to “Solution to Longest-Password by codility”

1. The extra code on checking the last possible word could be avoided if you don’t mind an infinite loop wrapper ^_^

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

   #include <cctype> #include <algorithm> #include <string> using namespace std; int solutionLongestPassword(string &S) {     long long cntAlpha = 0, cntDigit = 0, cnt = 0, ans = -1, len = S.size() * -1LL;     auto end = S.end(), itor = S.begin();     while (1) {         cntDigit = cntAlpha = cnt = 0;         while (itor != end && ' ' != *itor) {             if (isdigit(*itor))++cntDigit;             else if (isalpha(*itor))++cntAlpha;             else cnt = len;             ++itor, ++cnt;         }         if (cnt > 0 && cntDigit & 1 && !(cntAlpha & 1))ans = std::max(ans, cnt);         if (end == itor || end == ++itor)break;     }     return ans; }

   Reply

2. All in one line? Zen of Python or Evil of Python? 🙂

   1 2	def solution(S):     return max([len(str) for str in S.split() if len(str) & 1 and str.isalnum() and sum(c.isdigit() for c in str) & 1] + [-1])

   Reply

3. Also did Scala, take quite some time and didn’t find an one line solution…

   1 2 3 4 5 6

   object SolutionLongestPassword {   def solution(s: String): Int = {     def filter(strs: List[String]): List[Int] = for(str <- strs if 1 == (str.length() & 1) && str.forall(_.isLetterOrDigit) && 1 == (str.count(_.isDigit) & 1))yield str.length()     (-1 :: filter(s.split(" ").toList)).max   } }

   Reply

4. My C++ solution.

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

   #include<cctype> bool isPass(string& s)     {     unsigned num=0, lett=0;     for(unsigned i=0; i<s.size(); i++)     {         if(isalnum(s.at(i))==0)             return false;         if(isalpha(s.at(i))!=0) lett++;         if(isdigit(s.at(i))!=0) num++;     }     if(lett%2!=0 || num%2!=1) return false;     return true;     } int solution(string &S) {     string ss;     int maks=-1, n=0, res=-1;     int i=S.find(" ");     while(i!=S.npos)     {         ss=S.substr(n, i-n);         if(isPass(ss)==true) maks=ss.size();         res=max(res, maks);         n=++i;         i=S.find(" ",i);     }     ss=S.substr(n, S.size()-n);     if(isPass(ss)==true) maks=ss.size();     res=max(res, maks);     return res; }

   Reply

5. My c# solution:

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

   public static int LongestPassword(string value)         {             if (value == null || value.Length == 0) return -1;             Regex r = new Regex(@"^[a-zA-Z0-9]+$");             string[] passwords = value.Split(' ')                 .Where(x => x.Length % 2 != 0 && r.IsMatch(x) && x.Any(z => Char.IsDigit(z)))                 .ToArray();               if(passwords.Length == 0)             {                 return -1;             }               for (int i = 0; i < passwords.Length; i++)             {                 string password = passwords[i];                 if(password.Length == 1)                 {                     continue;                 }                     int countLetter = 0;                 int countNumbers = 0;                 for (int j = 0; j < password.Length; j++)                 {                     char c = password[j];                     if (Char.IsLetter(c))                     {                         countLetter++;                     }                       if (Char.IsDigit(c))                     {                         countNumbers++;                     }                       if(j == password.Length - 1 && (countNumbers % 2 == 0 || countLetter % 2 != 0))                     {                         passwords[i] = null;                     }                 }             }               if(passwords.All(x => x == null))             {                 return -1;             }               return passwords.Where(x => x != null).Max(x => x.Length);         }

   Reply