Strong Password, by HackerRank

-
It has been a while since I solved a HackerRank problem (they have not been posting new problems, now apparently there is a wave of new ones coming), here it is https://www.hackerrank.com/challenges/strong-password/problem:

There isn't a lot to "optimize" in the solution for this problem: pretty much just follow the 5 points mentioned in the problem description. There is some minor math to worry about, but other than that this is the kind of problem whose description is telling you how to solve it (just like those songs whose lyrics tell you how to dance to them ;)). Code is below, many hugs, Marcelo.

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution
{

 static int minimumNumber(int n, string password)
{
// Return the minimum number of characters to make the password strong

 if (password.Length != n) return 0;

 string numbers = "0123456789";
string lower_case = "abcdefghijklmnopqrstuvwxyz";
string upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string special_characters = "!@#$%^&*()-+";

 int retVal = 0;

 bool containsDigit = false;
bool containsLowercase = false;
bool containsUppercase = false;
bool containsSpecial = false;
for (int i = 0; i < n; i++)
{
if (numbers.Contains(password[i])) containsDigit = true;
if (lower_case.Contains(password[i])) containsLowercase = true;
if (upper_case.Contains(password[i])) containsUppercase = true;
if (special_characters.Contains(password[i])) containsSpecial = true;
}
if (!containsDigit) retVal++;
if (!containsLowercase) retVal++;
if (!containsUppercase) retVal++;
if (!containsSpecial) retVal++;

 if (n + retVal < 6)
{
retVal += (6 - n - retVal);
}

 return retVal;
}

 static void Main(String[] args)
{
int n = Convert.ToInt32(Console.ReadLine());
string password = Console.ReadLine();
int answer = minimumNumber(n, password);
Console.WriteLine(answer);
}
}


Comments

  1. Siva KumaranJuly 30, 2019 at 9:16 PM

    This comment has been removed by the author.

    ReplyDelete
  2. Siva KumaranJuly 30, 2019 at 9:18 PM

    This comment has been removed by the author.

    ReplyDelete
    Replies
    1. Siva KumaranJuly 30, 2019 at 9:24 PM

      Solution in Java

      https://drive.google.com/file/d/1nm3eQGt2Prz9-bxYIf-IRtie8xnBoHQW/view?usp=sharing

      Delete

Post a Comment

Popular posts from this blog

Changing the root of a binary tree

-
Image
If you work with graphics and eventually you want to pivot a binary tree using a different node as the root, this might be interesting to you. Here is the problem:  Change the Root of a Binary Tree - LeetCode 1666. Change the Root of a Binary Tree Medium 6 14 Add to List Share Given the  root  of a binary tree and a  leaf  node, reroot the tree so that the  leaf  is the new root. You can reroot the tree with the following steps for each node  cur  on the path  starting from the  leaf  up to the  root ​​​  excluding the root : If  cur  has a left child, then that child becomes  cur 's right child. Note that it is guaranteed that  cur  will have at most one child. cur 's original parent becomes  cur 's left child. Return  the new root  of the rerooted tree. Note:  Ensure that your solution sets the  Node.parent  pointers correctly after rerooting or you will receive "Wrong Answer".   Example 1: Input: root = [3,5,1,6,2,0,8,null,null,7,4], leaf = 7 Output: [7,2,nul
Read more

ProjectEuler Problem 719 (some hints, but no spoilers)

-
Image
Last time that I solved a ProjectEuler (PE) problem was in 2015... This is their latest problem as of today:  https://projecteuler.net/problem=719 Number Splitting        Problem 719 We define an  S S -number to be a natural number,  n n , that is a perfect square and its square root can be obtained by splitting the decimal representation of  n n  into 2 or more numbers then adding the numbers. For example, 81 is an  S S -number because  81 − − √ = 8 + 1 81 = 8 + 1 . 6724 is an  S S -number:  6724 − − − − √ = 6 + 72 + 4 6724 = 6 + 72 + 4 . 8281 is an  S S -number:  8281 − − − − √ = 8 + 2 + 81 = 82 + 8 + 1 8281 = 8 + 2 + 81 = 82 + 8 + 1 . 9801 is an  S S -number:  9801 − − − − √ = 98 + 0 + 1 9801 = 98 + 0 + 1 . Further we define  T ( N ) T ( N )  to be the sum of all  S S  numbers  n ≤ N n ≤ N . You are given  T ( 10 4 ) = 41333 T ( 10 4 ) = 41333 . Find  T ( 10 12 ) The rules of PE prevent me from disclosing the solution (they are very picky about it, rightfully so), but I can chat abo
Read more

The Power Sum, a recursive problem by HackerRank

-
Image
Another one by HackerRank:  https://www.hackerrank.com/challenges/the-power-sum : Find the number of ways that a given integer,  , can be expressed as the sum of the   power of unique, natural numbers. Input Format The first line contains an integer  .  The second line contains an integer  . Constraints Output Format Output a single integer, the answer to the problem explained above. Sample Input 0 10 2 Sample Output 0 1 Explanation 0 If   and  , we need to find the number of ways that   can be represented as the sum of squares of unique numbers. This is the only way in which   can be expressed as the sum of unique squares. Sample Input 1 100 2 Sample Output 1 3 Explanation 1 Sample Input 2 100 3 Sample Output 2 1 Explanation 2  can be expressed as the sum of the cubes of  .  . There is no other way to express   as th
Read more