StoreKing Interview Questions and Answers

Convert a decimal number to base 58 using a specific alphabet.

• Iterate through each test case and convert the decimal number to base 58 using the given alphabet.

• Handle the conversion by dividing the number by 58 and taking the remainder to find the corresponding base 58 character.

• Build the base 58 representation by appending the characters in reverse order.

• Output the final base 58 representation for each test case.

The task is to find the maximum number of fruits a bird can gather within a given time frame, moving between adjacent trees.

• Start from each tree and calculate the maximum fruits that can be gathered within the time frame.

• Use a sliding window approach to keep track of the fruits collected while moving between trees.

• Choose the starting tree that gives the maximum total fruits collected.

• Example: For input N=7, M=3, ARR={2, 1, 3, 5, 0, 1, 4}, the output is 9 by starting from tree...read more

The task is to find all distinct triplets in an array that sum up to a specified number.

• Iterate through the array and use nested loops to find all possible triplets.

• Use a set to store unique triplets and check if the sum equals the target sum.

• Handle edge cases like duplicate elements and no valid triplets.

• Return the triplets or -1 if no valid triplet exists.

Count distinct pairs in an array whose sum equals a given target.

• Use two pointers approach to iterate through the array and find pairs with sum equal to target.

• Keep track of visited pairs to avoid counting duplicates.

• Return -1 if no such pair exists with the given target.

Return all prime numbers less than or equal to a given positive integer N.

• Iterate from 2 to N and check if each number is prime using a helper function.

• A number is prime if it has only 2 factors: 1 and itself.

• Optimize by checking divisibility only up to square root of the number.