LeetCode
Question
·
Mar 2020
·
Los Angeles
Facebook | Phone | pow(x, n) & Inorder Predecessor in BST
4 upvotes
2,960 views
8 replies
Question Details
Question1: Implement method to calculate x to the power of n: Question 2: Given a target node in a BST, find the predecessor node. Note: not the parent note, but the next...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Binary Tree
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