mariazevedo88 / hackerrank-challenges Goto Github PK

Given a pointer to the root of the Huffman tree and a binary coded string to decode, print the decoded string.

It must return an integer that denotes the minimum possible value of unfairness.

Print the number of times a customer receives a notification

Given a list of edges and times, determine the minimum time to stop the attack of two machines on kingdom of Zion.

You have a number of machines that each have a fixed number of days to produce an item. Given that all the machines operate simultaneously, determine the minimum number of days to produce the required order.

Return an integer representing the minimum value of c[w] that can be added to allow creation of a balanced forest.

For each of the datasets, return the number of inversions that must be swapped to sort the dataset.

It must return an integer representing the number of element pairs having the required difference.

Given an integer, find the super digit of the integer.

Given an integer array of size n, find the maximum of the minimum(s) of every window size in the array.

Determine the maximum value of the sum of any of its subarrays.

It must return the number of distinct triplets that can be formed from the given arrays.

Process the insert/delete queries and report if any integer is there with particular frequency

It must return the lexicographically smallest string fitting the criteria.

Minimize the amount of money it costs of a group of friends to buy all 'n' flowers.

Perform the swap operation and store the indices of your in-order traversal to your result array. After all swap operations have been performed, return your result array for printing.

Find the number of ways to get from the bottom of a staircase to the top if you can jump 1, 2 or 3 stairs at a time.

Given a grid, a start and an end position, determine the number of moves it will take to get to the end position

Given a graph, determine the distances from the start node to each of its descendants and return the list in node number order, ascending.

It must return an array of integers representing the size of the maximum circle of friends after each query.

Help the ruler of HackerLand determine the cheapest way to give his citizens access to libraries.

Determine whether or not a number is prime in optimal time.

Remove some characters from the string such that the new string's characters have the same frequency.

Print the number of days after which no plant dies, i.e. the time after which there are no plants with more pesticide content than the plant to their left.

Help Sunny and Johnny spend all their money during each trip to the Ice Cream Parlor.

Determine if it's possible to make two strings equal. If so, print YES on a new line. Otherwise, print NO.

It should return an array of strings, each representing a row of the finished puzzle.

Create a queue data structure using two stacks.

Given an m x n matrix, find and print the number of cells in the largest region in the matrix.

Print the length of the longest string which is a common child of the input strings.

Given a list of integers as an input, find the maximum value that represents xor of two elements.

Given the root node of a binary tree, determine if it is a binary search tree.

For each query, it should return the decibinary number at that one-based index.

Find the largest solid area in which the mall can be constructed.

Given a color, find the shortest path connecting any two nodes of that color.

Karl wants to minimize the number of passes to obtain the required number of candies at the end of a day. Determine that number of passes.

Help Alice to minimize the total number of candies she must buy.

Given a binary tree, print its height.

Find the maximum sum of elements in an array.