Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
Algorithms: Power of Three and Min in Rotated Array
00:00
5 left

Algorithms: Power of Three and Min in Rotated Array

MediumPython

Problem

Taboola Feed processes numeric configuration values and ordered delivery segments. Implement one function that performs two independent checks: determine whether an integer is an exact power of 3, and find the smallest value in a rotated sorted array.

The array was originally sorted in strictly increasing order and then rotated at an unknown pivot. For example, [5, 6, 1, 2, 3, 4] is a rotation of [1, 2, 3, 4, 5, 6].

Formal Specification

Implement analyze_rotation(n, nums):

  1. Return whether n can be written as 3^k for an integer k >= 0.
  2. Return the minimum element in nums.

Return a dictionary with this exact structure: {"is_power_of_three": boolean, "minimum": integer}. The array contains distinct values and may be rotated zero positions. Do not sort the array, since the intended minimum search should use binary search.

Constraints

  • 1 <= n <= 10^18
  • 1 <= nums.length <= 10^5
  • -10^9 <= nums[i] <= 10^9
  • nums contains distinct integers
  • nums is a rotation of a strictly increasing sorted array

Function Signature

def analyze_rotation(n, nums):
Interviewer

Your question is Algorithms: Power of Three and Min in Rotated Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.