Search results
HackerRank Waiter problem solution. YASH PAL May 17, 2021. In this HackerRank Waiter problem solution, we have to Create an empty answer array. At each iteration, I, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible by the ith prime number. If it is, stack it in pile Bi.
Problem Statement : You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi.
Complete the waiter function in the editor below. waiter has the following parameters: int number[n]: the numbers on the plates ; int q: the number of iterations ; Returns. int[n]: the numbers on the plates after processing
Oct 19, 2020 · ⭐️ Content Description ⭐️In this video, I have explained on how to solve waiter problem by preprocessing prime numbers and list operations in python. This ha...
Waiter · Data Structures: Hackerrank Solutions. class Stack: def __init__(self): . self.A=plates. self.Ai=[] self.Bi=[] self.B=B. def pushAi(self, plate_no): . self.Ai.append(plate_no) def pushBi(self, plate_no): . self.Bi.append(plate_no) def popA(self): return self.A.pop() def popBi(self): return self.Bi.pop()
Feb 10, 2016 · Short Problem Definition: You are a waiter at a party. There are NN stacked plates. Each plate has a number written on it. You start picking up the plates from the top one by one and check whether the number written on the plate is divisible by a prime….
Dec 6, 2019 · Source: https://www.hackerrank.com/challenges/waiter/problem?h_r=internal-searchSkip to solution - 20:45Solution Code: https://gist.github.com/Shaddyjr/71b5b...
