Hackerrank - Detect HTML Tags Solution
In this challenge, we're using regular expressions to detect the various tags used in an HTML document.
Topic
Hackerrank
A collection of 419 issues
Hackerrank - Regex Find a Word Solution
Given sentences and words, for each of these words, find the number of its occurences in all the sentences.
HackerRank - Building a Smart IDE: Programming Language Detection Solution
We are trying to hack together a smart programming IDE. Help us build a feature which auto-detects the programming language, given the source code. There are only three languages which we are interested in "auto-detecting": Java, C and Python.
HackerRank - Detect the Domain Name Solution
Using this solution you can extract all the urls from a html page
HackerRank - Detect the Email Addresses Solution
We can use the solution found in this tutorial to scrap all email addresses from a web page
HackerRank Solution - Building a Smart IDE: Identifying comments
Building a Smart IDE: Identifying comments solution in python
HackerRank No Idea! Solution
There is an array of integers. There are also disjoint sets, and , each containing integers. You like all the integers in set and dislike all the integers in set . Your initial happiness is . For each integer in the array, if , you add to your happiness. If , you add to your
HackerRank Word Order Solution
You are given words. Some words may repeat. For each word, output its number of occurrences. The output order should correspond with the input order of appearance of the word. See the sample input/output for clarification.
Note: Each input line ends with a "\n" character.
Constraints:
The
HackerRank - Map and Lambda Function Solution
Let's learn some new Python concepts! You have to generate a list of the first N fibonacci numbers, 0 being the first number. Then, apply the map function and a lambda expression to cube each fibonacci number and print the list.
Concept
The map() function applies a function
HackerRank - Merge the Tools! Solution
Consider the following:
* A string, s , of length n where s = c0c1...cn-1.
* An integer, k , where k is a factor of n.
We can split s into n/k subsegments where each subsegment, ti , consists of a contiguous block of characters in . Then, use each to create string such