The question is to find the fewest number of operations needed to get to 1. available opperations: \t- add 1 \t- subtract 1 \t- divide by 2 input: 15 output: 5 because: 15->16->8->4->2->1

LeetCode Question · Jul 2020

Facebook Question

SWE

3 upvotes 3,666 views 14 replies

Question Details

The question is to find the fewest number of operations needed to get to 1. available opperations: - add 1 - subtract 1 - divide by 2 input: 15 output: 5 because: 15->16->8->4->2->1

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Coding

More from Meta

Reddit Leetcode is cooked in 2026 and we don't hire people who only grind leetcode. Reddit Returning to SWE work after 3 years of cancer treatment Reddit 2026 New Grad Recap Reddit Most likely failed meta phone screen Reddit Targeting OpenAI SWE Roles? Insights on what to expect from recent system design loops

← All Meta questions Meta Software Engineer Questions → All Dynamic-Programming Questions →