Programmingoneonone is a website that publishes daily tutorials, methods, guides, and articles on IT, Education, and technology.
In this HackerRank Day 19 Interfaces 30 days of code problem set, we need to take an integer input and then we need to subtract that integer and then add all the numbers and print the sum of them on the output screen. Problem solution in Python 2 programming. class Calculator(AdvancedArithmetic): def divisorSum(self, n): return…
Learn More “HackerRank Day 19 Interfaces 30 days of code solution” »
In this HackerRank Day 20 Sorting 30 days of code problem set, we need to develop a program that can accept an array as input and then sort those array elements, and then we need to print out that array. Problem solution in Python 2 programming. #!/bin/python import sys n = int(raw_input().strip()) a = map(int,raw_input().strip().split(‘…
Learn More “HackerRank Day 20 Sorting 30 days of code solution” »
In this HackerRank Day 21 Generics 30 days of code problem set, we need to write a function printArray that can take an array of generic elements as a parameter and that function can print each element of its generic array parameter on a new line. Problem solution in java programming. class Printer<E> { //Write your…
Learn More “HackerRank Day 21 Generics 30 days of code solution” »
In this HackerRank Day 22 Binary Search Trees 30 days of code problem set, we need to complete a function getHeight that can take a pointer input and then print the height of the binary search tree. Problem solution in Python 2 programming. def getHeight(self,root): if not root: return -1 else: return 1 + max(self.getHeight(root.left), self.getHeight(root.right))…
Learn More “HackerRank Day 22 Binary Search Trees 30 days of code solution” »
In this HackerRank Day 23 BST Level order traversal 30 days of code problem set, we need to complete a levelorder function that can accept a root node as an input and then print the level order traversal of the binary search tree. Problem solution in Python 2 programming. def levelOrder(self,root): #Write your code here…
Learn More “HackerRank Day 23 BST Level order traversal 30 days of code solution” »
In this HackerRank Day 24 More Linked Lists 30 days of code problem set, we need to complete the function removeDuplicates that can delete any node in the linked list that is duplicate. and return the head of the updated list. Problem solution in Python 2 programming. def removeDuplicates(self,head): #Write your code here current = head…
Learn More “HackerRank Day 24 More Linked Lists 30 days of code solution” »