Digit Wood
Your Coding Companion
-
Java Comparato in Java : Hacker Rank Solution : Digit Wood
Comparators are used to compare two objects. In this challenge, you’ll create a comparator and use it to sort an array. The Player class is provided for you in your editor. It has 2 fields: a name String and a score integer. Given an array of n Player objects, write a comparator that sorts them in order of decreasing score; if 2 or more players have the same…
-
Java Stack in Java : Hacker Rank Solution : Digit Wood
A string containing only parentheses is balanced if the following is true: 1. if it is an empty string 2. if A and B are correct, AB is correct, 3. if A is correct, (A) and {A} and [A] are also correct. Examples of some correctly balanced strings are: “{}()”, “[{()}]”, “({()})” Examples of some…
-
Java 1D Array (Part 2) in Java : Hacker Rank Solution : Digit Wood
Let’s play a game on an array! You’re standing at index 0 of an n-element array named game. From some index i (where 0 < = i < n), you can perform one of the following moves: In other words, you can move from index i to index i+1,i-1, or i + leap as long as the destination index is a cell containing a 0. If the destination…
-
Java BigDecimal in Java : Hacker Rank Solution : Digit Wood
Java’s BigDecimal class can handle arbitrary-precision signed decimal numbers. Let’s test your knowledge of them! Given an array,s , of n real number strings, sort them in descending order — but wait, there’s more! Each number must be printed in the exact same format as it was read from stdin, meaning that .1 is printed as 0.1, and  is printed as . If…
-
Tag Content Extractor in Java : Hacker Rank Solution : Digit Wood
In a tag-based language like XML or HTML, contents are enclosed between a start tag and an end tag like <tag>contents</tag>. Note that the corresponding end tag starts with a /. Given a string of text in a tag-based language, parse this text and retrieve the contents enclosed within sequences of well-organized tags meeting the following criterion: Input Format The first line of input contains a…
-
Java Regex 2 – Duplicate Words : Hacker Rank Solution : Digit Wood
In this challenge, we use regular expressions (RegEx) to remove instances of words that are repeated more than once, but retain the first occurrence of any case-insensitive repeated word. For example, the words love and to are repeated in the sentence I love Love to To tO code. Can you complete the code in the editor so it will turn I love Love…
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