No title available
Stranger Things
Andulka
Peter Solarz
he wasn't even looking at me and he found me
Not today Justin
h
Kaledo Art
JBB: An Artblog!
No title available
trying on a metaphor
No title available
Origami Around
Cosmic Funnies
pixel skylines
祝日 / Permanent Vacation
JVL
izzy's playlists!
Love Begins
Keni
seen from Germany
seen from Bangladesh
seen from Mauritius
seen from Mauritius
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from Brazil
seen from Malaysia
seen from United States
@ziameraj16
HackerRank - QHEAP1
HackerRank – QHEAP1
Overview In this article we will try to solve one of the problem from HackerRank, it’s called QHEAP1. There are types of query: ” 1 v” – Add an element v to the heap.” 2 v” – Delete the element v from the heap.“3” – Print the minimum of all the elements in the heap. It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct elements will be…
View On WordPress
HackerRank - Beautiful Days at the Movies
HackerRank – Beautiful Days at the Movies
Overview In this article we will try to solve one of the problem from HackerRank. The problem is called Beautiful Days at the Movies Lily likes to play games with integers. She has created a new game where she determines the difference between a number and its reverse. For instance, given the number 12, its reverse is 21. Their difference is 9. The number 120 reversed is 21, and their…
View On WordPress
Electronic Shop (Hacker Rank)
Electronic Shop (Hacker Rank)
Overview In this article we will try to solve one of the problem from HackerRank called Electronic Shop. A person wants to determine the most expensive computer keyboard and USB drive that can be purchased with a give budget. Given price lists for keyboards and USB drives and a budget, find the cost to buy them. If it is not possible to buy both items, return -1. Example b = 60 keyboards =…
View On WordPress
Self Descriptive Numbers
Overview In this article we will write a program to find if the given number is a Self Descriptive Number or not. In mathematics, a self-descriptive number is an integer m that in a given base b is b digits long in which each digit d at position n (the most significant digit being at position 0 and the least significant at position b−1) counts how many instances of digit n are in…
View On WordPress
Between Two Sets
Overview In this article we will try to solve one of the problem mentioned in Hacker Rank. The name of the problem is Between Two Sets. There will be two arrays of integers. Determine all integers that satisfy the following two conditions: The elements of the first array are all factors of the integer being consideredThe integer being considered is a factor of all elements of the second…
View On WordPress
Flipping Bits
Overview In this article we will try to solve one of the problem from Hacker Rank. The problem is called Flipping Bits. You will be given a list of 32 bit unsigned integers. Flip all the bits (1 –> 0 and 0 –> 1) and return the result as an unsigned integer. Example n = 910910 = 10012In 32 bits it will be represented as 000000000000000000000000000010012The inverted bits will be…
View On WordPress
Origin containing triangle
Overview In this article we will try to solve a problem mention in the Perl Weekly Challenge called Origin-containing triangle. We are given the coordinates of the triangle A(x1, y1), B(x2, y2) and C(x3, y3). We need to find whether the origin O(0, 0) lies between the triangle. Solution What we need to do is to find the areas of triangle ABO, BCO and ACO. if the sum of the areas of these…
View On WordPress
HackerRank - Making Anagrams
HackerRank – Making Anagrams
Overview In this article we will see how to solve the Making Anagrams problem mentioned in Hacker rank. A student is taking a cryptography class and has found anagrams to be very useful. Two strings are anagrams of each other if the first string’s letters can be rearranged to form the second string. In other words, both strings must contain the same exact letters in the same exact frequency.…
View On WordPress
Convert time format 12Hr/24Hr
Convert time format 12Hr/24Hr
Overview In this article we will see how to convert a 12 hour time format to a 24 hour one and vice versa. For example a 05:15pm in a 24 hour format is represented as 17:15. 12:00 am is represented as 00:00. Similarly, 19:15 in 24 hour format is represented as 07:15pm in a 12 hour format. Code First we need to check in which format we need to convert. We check if the input string has an of…
View On WordPress
Minimum Triangle Sum
Overview In this article we will try to solve one of the problem mentioned in Perl Weekly Challenge in Java. The problem is called Triangle Sum. You are given triangle array. You need to find the minimum path sum from top to bottom. When you are on index i on the current row then you may move to either index i or index i + 1 on the next row. Example 1 Input: Triangle = [ [1], [2,4], [6,4,9],…
View On WordPress
Hacker Rank - Apple and Orange
Hacker Rank – Apple and Orange
Overview In this article we will try to solve one of the problem from Hacker Rank. It’s called Apple and Orange. Sam’s house has an apple tree and an orange tree that yield an abundance of fruit. Using the information given below, determine the number of apples and oranges that land on Sam’s house. s is the start point of the house, and t is the endpoint. The apple tree is to the left of the…
View On WordPress
Hacker Rank - Time Conversion - Java/Kotlin
Hacker Rank – Time Conversion – Java/Kotlin
Overview In this article we will try to solve the Time Conversion problem mentioned in Hacker Rank. Given a time in 12-hour AM/PM format, convert it to military (24-hour) time. Example Input: 12:00:00AM Output: 00:00:00 Input: 12:00:00PM Output: 12:00:00 Input: 12:01:00PM Output: 12:01:00 Input: 12:01:00AM Output: 00:01:00 Input: 07:05:45PM Output: 19:05:45 Code First get the values of…
View On WordPress
Caesar Cipher - Java
Caesar Cipher – Java
Overview In this article we will see how to solve the Caesar Cipher problem mention in Perl Weekly Challenge. You are given string $str containing alphabets A..Z only and a number $n. Write a program to encrypt the given string $str using Caesar Cipher with left shift of size $n. Figure 1. Caesar Cipher It is a type of substitution cipher in which each letter in the plaintext is replaced by a…
View On WordPress
Edit Distance
Overview In this section we will try to solve a problem mentioned in Perl Weekly Challenge. The problem is called Edit Distance. You are given two strings str1 and str2. Write a function to find out the minimum operations required to convert str1 into str2. The operations can be insert, remove or replace a character. Example Input: str1 = "kitten"; str2 = "sitting" Output: 3 Operation 1:…
View On WordPress
Reverse a string
Overview In this example we will see how to reverse a string in Java. This problem is mention in Perl Weekly Challenge. Let us say we have a string ‘This is the best language in the world’. The method should return ‘world the in language best the is This‘. All the leading and trailing spaces should be removed and if there are more than one spaces between the words it should be reduced to one…
View On WordPress
Jumping on the clouds
Jumping on the clouds
Overview In this example we will see how to solve the Jumping on the clouds example mentioned in Hacker Rack in Java. There is a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. The player can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus 1 or 2. The player must avoid the…
View On WordPress
Java Solution for Repeated String
Java Solution for Repeated String
Overview In this article we will see how to solve a Repeated String problem in Java. This problem is described in Hacker Rank. There is a string, s, of lowercase English letters that is repeated infinitely many times. Given an integer, n, find and print the number of letter a’s in the first n letters of the infinite string. Example s = ‘abcac’, n = 10 The substring we consider is abcacabcac,…
View On WordPress