Digit Wood
Your Coding Companion
-
Valid Username Regular Expression : Hacker Rank Solution : Digit Wood
You are updating the username policy on your company’s internal networking platform. According to the policy, a username is considered valid if all the following constraints are satisfied: Sample Input Sample Output SOLUTION: FOLLOW FOR MORE QUESTIONS AND SOLUTIONS |Â DIGIT WOOD
-
Pattern Syntax Checker : Hacker Rank Solution : Digit Wood
Using Regex, we can easily match or search for patterns in a text. Before searching for a pattern, we have to specify one using some well-defined syntax. In this problem, you are given a pattern. You have to check whether the syntax of the given pattern is valid. Note: In this problem, a regex is only…
-
Java String Tokens : Hacker Rank Solution : Digit Wood
Given a string, s, matching the regular expression [A-Za-z !,?._’@]+, split the string into tokens. We define a token to be one or more consecutive English alphabetic letters. Then, print the number of tokens, followed by each token on a new line. Note: You may find the String.split method helpful in completing this challenge. Input Format A single string,s . Output Format…
-
Java Anagrams : Hacker Rank Solution : Digit Wood
Two strings,  and , a are b called anagrams if they contain all the same characters in the same frequencies. For this challenge, the test is not case-sensitive. For example, the anagrams of CAT are CAT, ACT, tac, TCA, aTC, and CtA. Function Description Complete the isAnagram function in the editor. isAnagram has the following parameters: Returns Input Format The first line contains a string a .The second line…
-
Java String Reverse : Hacker Rank Solution : Digit Wood
A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward or forward. Given a string , print Yes if it is a palindrome, print No otherwise. Constraints  will consist at most  lower case english letters. Sample Input Sample Output SOLUTION: FOLLOW FOR MORE QUESTIONS AND SOLUTIONS | DIGIT WOOD
-
Java Substring Comparisons : Hacker Rank Solution : Digit Wood
We define the following terms: Lexicographical Order, also known as alphabetic or dictionary order, orders characters as follows: A < B <… < Y < Z < a < b < … < y < z For example, ball < cat, dog < dorm, Happy < happy, Zoo < ball. A substring of a string…
About
We are a passionate developers constantly working to create solution of Competitive programming Problems that’s accurate and easier to understand.
Recent Post
- Summer Time I Codechef Solution || Codechef contest solution
- Binary Parity I Codechef Solution || Codechef contest solution
- Cricket Tournament I Codechef Solution || Codechef contest solution
- Multi Level Inheritance in C++ : Hacker Rank Solution : Digit Wood
- Rectangle Area in C++ : Hacker Rank Solution : Digit Wood