DS_Store. length; j++) {. length; i++) {. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. java","contentType":"file. sql","path":"sql/select-by-id/select-by-id. 6 of 6 {"payload":{"allShortcutsEnabled":false,"fileTree":{"Algorithms/Implementation/Sock Merchant":{"items":[{"name":"Solution. When they open the book, page 1 is always on the right side:{"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":" Java Stdin and Stdout I. Sales By Match / Sock Merchant: Java Code SolutionHackerRank Reduce Function solution in python 2, python 3, and pypy, pypy3 programming language with practical program code example with explainationDetermine the most expensive Keyboard and USB drive combination one can purchase within her budget. {"payload":{"allShortcutsEnabled":false,"fileTree":{"Easy":{"items":[{"name":"A very big sum. sidenote: most solutions have time complexity O( n*m ). A description of the problem can be found on Hackerrank. java","contentType":"file"},{"name. Then we will declare a variable maxnum and initialize it to 0. BC Robotics Inc. There is a large pile of socks that must be paired by color for sale. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. Precompute the 8 magic squares instead of computing at runtime 2. The solution has been provided in Java, C++ and C. array (input (). Example a = [1,1,2,2,4,4,5,5,5] There are two subarrays meeting the criterion: [1,1,2,2] and [4,4,5,5,5]. This hacker. #!/bin/python3 import sys n = int (input (). Student 2 received a 67, and the next multiple of 5 from 67 is 70. In this HackerRank Cats and a Mouse problem, You are given q queries in the form of x, y, and z representing the respective positions for cats A and B, and for mouse C. java","path":"Easy/A very big sum. The store has several models of each. Simple Python3 solution using itertools from itertools import product def getMoneySpent ( keyboards , drives , b ) : max_price = - 1 for keyboard , drive in product ( keyboards , drives ) : price = keyboard + drive if price <= b : max_price = max ( most_expensive , price ) return max_price🍒 Solution to HackerRank problems. java","path":"Easy/A very big sum. Look at the implementation. util. java","path":"Easy/A very big sum. A driver is driving on the freeway. . Problem: 2 min read · Nov 12, 2019--Neeta Sawant. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. A student can either start turning pages from the front of the book or from the back of the book. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"bit manipulation","path":"bit manipulation","contentType":"directory"},{"name":"constructive. . HackerRank Reduce Function solution in python 2, python 3, and pypy, pypy3 programming language with practical program code example with explainationA description of the problem can be found on Hackerrank. ar: the colors of each sock. Student 3 received a 38, and the. If the sum of minimum element of keyboards list and minimum element of drives list is greater than the budget i. Then they climb out and up onto a mountain 2 units high. {"payload":{"allShortcutsEnabled":false,"fileTree":{"hackerrank":{"items":[{"name":"a-very-big-sum. I incremented second pointer and tried to find out if the difference between values at the pointers is greater than 1. Reload to refresh your session. If you select the "Pypy 3" language, you get only…. Given price lists for keyboards and USB drives and a budget, find the cost to buy them. A reviewer rates the two challenges, awarding points on a scale from 1 to 100 for three categories: problem clarity, originality, and difficulty. import scala. In this HackerRank java sort problem in a java programming language, You are given a list of student information: ID, FirstName, and CGPA. Manasa and Stones in C++ . The compiler will infer it from what is declared on the left hand side. HackerRank Electronics Shop Problem Solution. Source object Solution extends App. Student 1 received a 73, and the next multiple of 5 from 73 is 75. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. Code your solution in our custom editor or code in your own environment and upload your solution as a file. Source – Ryan Fehr’s repository. Used Computer Store. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. {"payload":{"allShortcutsEnabled":false,"fileTree":{"challenges":{"items":[{"name":"a-very-big-sum. getMoneySpent has the following parameter(s): keyboards: an array of integers representing keyboard pricesHackerrank – Problem Statement. Monica wants to buy a keyboard and a USB drive from her favorite electronics store. My Python solution (passes all test cases), I am sure there is a way to clean it up a bit, let me know your thoughts! from string import ascii_lowercase res = '' for char in s : if char . If you want any solution to any problem. std::sort(array. We have to loop through each combination. isalpha () : current_index = ascii_lowercase . Since 70 – 67 = 3, the grade will not be modified and the student’s final grade is 67. 14 subscribers 407 views 3 years ago In this video we will be solving the Electronics Shop problem on hackerrank using Python. An integer d is a divisor of an integer n if the remainder of n÷d = 0. js This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. Code your solution in our custom editor or code in your own environment and upload your solution as a file. A person wants to determine the most expensive computer keyboard and USB drive that can be purchased with a given budget. About Press Copyright Contact us Creators Advertise Developers Terms Privacy Policy & Safety How YouTube works Test new features NFL Sunday Ticket Press Copyright. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. . #DSA #algorithms #problemsolving #coding…Challenges solved in this repo are found in Hackerrank. Yes, on the solution repo linked in the original post, this problem is tagged with a n = n+m tag. Hackerrank – Problem Statement. I have been working on this question, and after submitting my code 7 cases passed, however, 9 cases failed. Initialize it to -1. Delivering world-class business process and information technology services to British Columbia's. Our goal is to compute the costly pair of keyboard & drive we can get from the the store, given the budget (b). Electronics Shop. Solutions to HackerRank problems. Code Solution. I'm solving this problem in JS It's just a way for me to keep solving questions. // Complete this function. Electronics Shop. Hackerrank Problem:Electronics Shop solutionProblem link:{"payload":{"allShortcutsEnabled":false,"fileTree":{"HackerRank-Climbing the Leaderboard":{"items":[{"name":"Climbing_the_Leaderboard. You will be given their starting positions. py","path":"HackerRank-Bon App-tit/Bon Appétit. It must return an integer representing the number of matching pairs of socks that are available. Hackerrank – Problem Statement. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"bit manipulation","path":"bit manipulation","contentType":"directory"},{"name":"constructive. Here's the full solution with just 2 loops Hackerrank - Electronics Shop Solution{"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"HackerRank Problems","path":"HackerRank Problems","contentType":"directory"},{"name":"2D. if __name__ == ‘__main__’:Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. Prepare Algorithms Implementation Electronics Shop Electronics Shop Problem Submissions Leaderboard Discussions Editorial A person wants to determine the most. A description of the problem can be found on Hackerrank. . hackerrank / electronics-shop / Solution. The th tuple contains the th element from each of the argument sequences or iterables. array (a,float) #z = np. ALSO READ: HackerRank Solution: Python If-Else [3 Methods] This implementation is different from the previous ones in that it creates a list from the input string, modifies the element at the specified position, and then joins the elements of the list to return a new string. The Best Place To Learn Anything Coding Related - For Your Coding Interviews? Use These Resources. comment. The Benefits of Learning Coding and Programming: Getting an education in coding and programming is one of the best things you can do to improve your life. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. cpp","path":"Algorithms/Implementation. Below is the list of the Hackerrank Algorithms problems in various categories. As you can see, we need a Python loop to solve the question using a max of two lines. and if you personally want any program. Don't forget to like and share 😄-----🔴 Subscribe Coding Demons for more easy and simple. In this HackerRank. Most simple solution. split () z=np. c","contentType":"file. As the problem is under Easy Section so it doesn't require any explanation. Equalize the Array . Let Monica has total money MTotal. Over the course of the next few (actually many) days, I will be posting the solutions to previous Hacker Rank challenges. Dot and Cross – Hacker Rank Solution. Source – Ryan Fehr’s repository. Contribute to alexprut/HackerRank development by creating an account on GitHub. In this HackerRank Grading Students problem solution, HackerLand University has the following grading policy: Every student receives a grade in the inclusive range from 0 to 100. {"payload":{"allShortcutsEnabled":false,"fileTree":{"General Programming/Basic Programming/Electronics Shop":{"items":[{"name":"Solution. If you want any solution to any problem. Iterating through each string, compare the absolute difference in the ascii values of the characters at positions 0 and 1, 1 and 2 and so on to the end. Possible optimizations: 1. Hackerrank sub array division solution This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. countNums = Counter (a) countNums will contain count of each element in a. 1. cs","path":"Algorithms. floor (people / 2) result += half people = 3 * half. 1918' adhering to dd. The store has several models of each. . append e: Insert integer e at the end of the list. Monica wants to buy a keyboard and a USB drive from her favorite electronics store. Function Description. Monica wants to spend as much as possible for the 2 items, given her budget. If the cats arrive at the same time, the mouse will. and if you personally want any program. cs","path":"Algorithms. java","contentType":"file"},{"name. text. TOC: sort keyboards ACS; sort drives DESC; start to move alongside keyboards and drives chopping them to keep keyboards[0] + drives[0] < budget; update max_billWhat's the largest size subset can you choose from an array such that the difference between any two integers is not bigger than 1?Given the names and grades for each student in a class of N students, store them in a nested list and print the name(s) of any student(s). Contribute to akshaytekam/Electronics_Shop_HackerRank development by creating an account on GitHub. . Let Monica has total money MTotal. eg. DS_Store. Eliminating the elements to the right, left and bottom with current max will drastically bring down comparisons in large data set. md","path":"README. . 100 HackerRank Solution in Order. Monica wants to spend as much as possible for the 2 items, given her budget. . Finally, the hiker returns to sea level and ends the hike. HackerRank The Hurdle Race problem solution. Problem: 2 min read. Advanced Solutions, a DXC Technology Company | 7,450 followers on LinkedIn. {"payload":{"allShortcutsEnabled":false,"fileTree":{"Problem Solving Algorithms/Solutions/02 Implementation":{"items":[{"name":"01 Grading Students. *; Disclaimer: The above Problem ( Migratory Birds) is generated by Hacker Rank but the Solution is Provided by CodingBroz. That is, if you have the "Python 3" language selected. . Luckily, a service lane runs parallel to the highway. The first implementation used a while loop to iterate through the. 09. {"payload":{"allShortcutsEnabled":false,"fileTree":{"HackerRank-The Hurdle Race":{"items":[{"name":"The_Hurdle_Race. In this HackerRank List Comprehensions problem solution in python, Let's learn about list comprehensions! You are given three integers x,y and z representing the dimensions of a cuboid along with an integer n. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"bit manipulation","path":"bit manipulation","contentType":"directory"},{"name":"constructive. Problem 23: Electronics Shop Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder). If step equals to ‘U’ we will increment level by 1, which indicates the hiker hiking a level above. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Electronics Shop - Hackerrank Solution . Hello Guys, Here is the Solution of Electronics shop in Hackerrank using Javascript. We are proving Algorithms Solutions in Warmup, Implementation, Strings, Sorting, Search, Graph Theory, Greedy, Dynamic Programming, Constructive Algorithms, Bit Manipulation, Recursion, Game Theory, and NP-Complete Categories. math. Here is the list of challenges to solve. Solution : Consider a lowercase English alphabetic letter character denoted by c. If the list of absolute differences is the same for both strings, they are funny. Hackerrank - Electronics Shop Solution. This is the java solution for the Hackerrank problem – Electronics Shop – Hackerrank Challenge – Java Solution. This is how beginner’s solution look like as compare your solution. We'll start with brute force approach and optimize the solution around it. The Benefits of Learning Coding and Programming: Getting an education in coding and programming is one of the best things you can do to improve your life. The maximum length subarray has 5 elements. A person wants to determine the most expensive computer keyboard and USB drive that can be purchased with a give budget. YASH PAL March 26, 2021. java","path":"Algorithms/Implementations/AcmIcpcTeam. YASH PAL March 26, 2021. For example, assume the sequence . A student can either start turning pages from the front of the book or from the back of the book. end()); Integer variable result will store the length of the subarray with maximum size, count will store the length of the subarray being processed and subarray_first. ]) This function returns a list of tuples. sort: Sort the list. Determine whether or not Brian overcharged Anna for their split bill. Here is the Algorithm: Initialize a variable maxValue to have value as . steps = 8 path = [DDUUUUDD] The hiker first enters a valley 2 units deep. Given the price lists for the store’s keyboards and USB drives, and Monica’s budget, find and print the amount of money Monica will spend. cpp","path":"Algorithms. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"ML OJT codes","path":"ML OJT codes","contentType":"directory"},{"name":"Object detection. java Go to file Go to file T; Go to line L; Copy path Copy permalink; This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository. sockMerchant has the following parameter (s): n: the number of socks in the pile. It should return the maximum total price for the two items within Monica's budget, or -1 if she cannot afford both items. If cat catches the mouse first, print Cat A. cpp","path":"angry_professor. py: Implementation: Easy: Picking Numbers: picking-numbers. pickingNumbers has the following. HackerRank Challenge SolvedStep by step tutorial with detailed explanations About Press Copyright Contact us Creators Advertise Developers Terms Privacy Policy. Problem Name: Electronics Shop | Source: HackerRankLink to HackerRank Problem: this video yo. py Go to file Go to file T; Go to line L; Copy path Copy permalink; This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository. C, C++, Java, Python, C#. sql","contentType. hackerrank sub array division solution Raw. Check if original grid is a magic square before doing anything and return 0 if it is. Here is the explanation for my JavaScript solution: function getMoneySpent (keyboards, drives, s) {. py","path":"HackerRank-Breaking the. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. Student 2 received a 67, and the next multiple of 5 from 67 is 70. Implementation | Modified Kaprekar Numbers . The store has several models of each. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"README. Hackerrank-ElectronicsShop-JS-solution Function description. To see every contributors, please reference at here. c","path":"hackerrank/a-very-big-sum. To determine whether a string is funny, create a copy of the string in reverse e. Possible Solutions. {"payload":{"allShortcutsEnabled":false,"fileTree":{"HackerRank-Designer PDF Viewer":{"items":[{"name":"Designer_PDF_Viewer. : fine = 0). Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. com Hackerrank - Electronics Shop Solution. Use <> instead. . Electronics Shop hackerrank solution in javascript. Plus and Minus Algorithm not working (JavaScript) 0. In this HackerRank Strong Password problem, Give the string she typed, can you find the minimum number of characters she must add to make her password strong. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. I do what is described in problem description. Look at the implementation. 4 of 6; Test your code You can compile your code and test it for errors. Hence, if year equals to 1918 we return ‘26. Electronics Shop hackerrank solution in javascript. Round student grades according to Sam's rules. We manufacture 80+ different electronic. List of Algorithms and data structures for Competitive Programming…Solve Challenge. py","path":"challenges/a-very-big-sum. The input is keyboards and drives cost arrays and budget. Big O notation dictates an upper bound not a case by case runtime. Leave a Comment / HackerRank, HackerRank Algorithms / By CodeBros Hello coders, today we are going to solve Time Conversion HackerRank Solution which is a Part of HackerRank Algorithm Series. Please read ourHackerRank Solutions. py","path":"HackerRank-Electronics Shop. Query 0: The positions of the cats and mouse are shown below: Cat will catch the mouse first, so we print Cat B on a new line. The rating for Alice's challenge is the triplet a = (a [0], a [1], a [2]), and the rating for Bob's challenge is the triplet b = (b [0], b [1], b. This solution can be scaled to provide weightage to the products. Hackerrank – Problem Statement. Like, subscribe to our channel for new updates. Learn more about TeamsWe use cookies to ensure you have the best browsing experience on our website. HackerRank: Electronics Shop. 6 of 6Problem- Monica wants to buy a keyboard and a USB drive from her favorite electronics store. Eliminating the elements to the right, left and bottom with current max will drastically bring down comparisons in large data set. =, +, and / should have whitespace on both sides. // then compare to the money. split (), float) print (z [::-1]) HackerRank Arrays solution in python2, python3 and pypy, pypy3 programming language with practical program code. islower. java","path":"Easy/A very big sum. Solve Challenge. If both cats reach the mouse at the same time, print Mouse C as the two cats fight and mouse escapes. 🌐 Website: 🔔 Subs. hackerrank sub array division solution Raw. First, I started with sorting the array. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. Abstract Classes - Polymorphism Hackerrank Solution in C++. js This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. A cache is a component that stores data so future requests for that. If the level becomes 0 immediately after the hiker climbs a. *My Profil. java","path":"Algorithms/Implementations/AcmIcpcTeam. In this HackerRank Encryption problem, An English text needs to be encrypted using the following encryption scheme. Now let us go through the possible solutions for the given problem. #hackerranksolutions #hackerrank #hackerrankpush #javascript#string #java. Beautiful Days at the Movies hackerrank solution in javaScript. For example, and ,shift (a) = b , shift (e) = f, shift (z) = a . Naive Approach: The given problem can be solved by selling the product from suppliers having the current maximum number of products left. Missing Numbers in C . Cannot retrieve contributors at this time. Connect and share knowledge within a single location that is structured and easy to search. Learn more about bidirectional Unicode characters. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"README. def wrap (string, max_width): return string=str (input ()) max_width=int (input ()) #print (string) #print (max_width) print (textwrap. ALSO READ: HackerRank Solution: Athlete Sort Python [3 Methods] Summary. #Hackerrank #hacker #hackers #hackerstayawayHackerrank Electronics Shop Problem Solution in JavaThis is a Hackerrank Problem Solving seriesSari videos dekhne. DS_Store. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. reverse: Reverse the list. We define a magic square to be an matrix of distinct positive integers from to where the sum of any row, column, or diagonal of length is always equal to the same number: the magic constant. In this HackerRank The Hurdle Race problem you need to complete the hurdleRace function that has an integer variable and an integer array as a parameter and needs to return a minimum number of doses required by a player. Electronics Shop hacker rank solution in C October 19, 2019 code is here: #include < stdio. Baskar Karunanithi 6th June 2021 Leave a Comment. Monica wants to spend as much as possible for the items, given her budget. Some are in C++, Rust and GoLang. py","path. They always turn pages one at a time. {"payload":{"allShortcutsEnabled":false,"fileTree":{"sql/select-by-id":{"items":[{"name":"select-by-id. {"payload":{"allShortcutsEnabled":false,"fileTree":{"HackerRank-Electronics Shop":{"items":[{"name":"Electronics_Shop. 5 of 6; Submit to see results When you're ready, submit your solution! Remember, you can go back and refine your code anytime. {"payload":{"allShortcutsEnabled":false,"fileTree":{"challenges":{"items":[{"name":"a-very-big-sum. Time ConversionEasyProblem Solving (Basic)Max Score: 15Success Rate: 92. Determine the most expensive Keyboard and USB drive combination one can purchase within her budget. md","contentType":"file"},{"name":"arithmetic_operations. November 30, 2022. To review, open the file in an editor that reveals hidden Unicode characters. *; import java. let max = -1; // I'm trying to get the total number of keyboard and drive. 1. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. {"payload":{"allShortcutsEnabled":false,"fileTree":{"All Tracks/Core CS/Algorithms/Implementation/Picking Numbers":{"items":[{"name":"Solution. First, the spaces are removed from the text. Drawing Book (HackerRank JavaScript Solution) 🚀🚀. cpp","contentType":"file"},{"name":"breaking. 4 of 6; Test your code You can compile your code and test it for errors and accuracy before submitting. Source – Ryan Fehr’s repository. A description of the problem can be found on Hackerrank. The problem is to find the most expensive. hackerrank_solution_of_electronics_shop_in_javascript. I do what is described in problem description. {"payload":{"allShortcutsEnabled":false,"fileTree":{"HackerRank-Bon App-tit":{"items":[{"name":"Bon Appétit. HackerRank Circular Array Rotation problem solution. Please read our{"payload":{"allShortcutsEnabled":false,"fileTree":{"HackerRankDashboard/CoreCS/GeneralProgramming/src/main/java/com/javaaid/hackerrank/solutions/generalprogramming. If mouse is at position , it is units from cat and unit from cat . Monica wants to spend as much as possible for the 2 items, given her budget. Given the sequence of up and down steps during a hike, find and print the number of valleys walked through. # Enter your code here. Problem Name: Electronics Shop | Source: HackerRankLink to HackerRank Problem: this video yo. Problem:A tag already exists with the provided branch name. swift","path. lower ()) shifted_index = ( current_index + k ) % len ( ascii_lowercase ) if char . Each value of between and , the length of the sequence, is analyzed as follows:In this HackerRank Picking Numbers problem You have Given an array of integers, find the longest subarray where the absolute difference between any two elements is less than or equal to 1. def wrap (string, max_width): return string=str (input ()) max_width=int (input ()) #print (string) #print (max_width) print (textwrap. Get reviews and contact details for each business, including 📞 phone number, 📍 address,. pop: Pop the last element from the list. Here, 0<=i<=x; 0<=j<=y. 19/08/2022 at 4:29 PM. {"payload":{"allShortcutsEnabled":false,"fileTree":{"Algorithms/Implementation":{"items":[{"name":"two-kings","path":"Algorithms/Implementation/two-kings. Picking Numbers HackerRank Solution in C, C++, Java, Python January 21, 2021 January 15, 2021 by Aayush Kumar Gupta Given an array of integers, find the longest subarray where the absolute difference between any two elements is less than or equal to . DS_Store. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. e. 4 of 6; Test your code You can compile your code and test it for errors and accuracy before submitting. A description of the problem can be found on Hackerrank. When a programmer submits a solution to a programming challenge, their submission is scored on the accuracy of their output. {"payload":{"allShortcutsEnabled":false,"fileTree":{"Algorithms/Implementation/Angry Professor":{"items":[{"name":"Solution. Prepare Algorithms Implementation Electronics Shop Electronics Shop Problem Submissions Leaderboard Discussions Editorial A person wants to determine the most expensive computer keyboard and USB drive that can be purchased with a give budget. py","path":"HackerRank-Electronics Shop. Then we will use a for loop and iterate over range (1, 100) using a variable i. Checklist. 5 of 6; Submit to see results When you're ready, submit your solution! Remember, you can go back and refine your code anytime. loop through keyboard, make an inner loop for usb 3. {"payload":{"allShortcutsEnabled":false,"fileTree":{"General Programming/Basic Programming/Electronics Shop":{"items":[{"name":"Solution. cs","path":"Algorithms/Implementation. You can learn how to solve problems, become better at your job, and make your dreams come true. more Try YouTube Kids Learn more Comments. {"payload":{"allShortcutsEnabled":false,"fileTree":{"Algorithms/Implementation":{"items":[{"name":". Pavol Pidanič. abc -> cba. Query 1: In this query, cats A and B reach mouse C at the exact same time: . {"payload":{"allShortcutsEnabled":false,"fileTree":{"Easy":{"items":[{"name":"A very big sum. c","contentType":"file. In addition Big O dictates that O (n) is equivalent to O (2n) and O (n + m) is equivalent to O (2n) where n = m. Code your solution in our custom editor or code in your own environment and upload your solution as a file. Example. README. Given the price lists for the store's keyboards and USB drives, and Monica's budget, find and print the amount of money. if min (keyboards) + min (drives) > b: 2 Answers. hackerrank_solution_of_electronics_shop_in_javascript. strip ()) p = int (input (). Do modulo again because. I'm solving this problem in JS It's just a way for me to keep solving questions.