Meta Software Engineer Interview Questions

Dhruv M. - "During my internship at Inceptra Analytics, our team was working on improving the monthly reporting process for the operations department. I proposed switching from manual Excel reports to a Power BI dashboard to automate and visualize key metrics. However, some team members were hesitant—they felt the current process, although tedious, was more familiar and controllable. My task was to get buy-in from the team to adopt a more efficient reporting method without causing disruption or resistance."See full answer

Yomna H. - "Evication Strategy: LFU Access Pattern: Write Around"See full answer

Graig - "Yes to peer manager from stackholder team the problem was every time she wanted say something she used to have three way connect with me and my manager"See full answer

Vidhyadhar V. - "public class CircularBuffer { private T[] buffer; private int head; private int tail; private int size; private final int capacity; public CircularBuffer(int capacity) { this.capacity = capacity; this.buffer = (T[]) new Object[capacity]; this.head = 0; this.tail = 0; this.size = 0; } public void enqueue(T item) { if (isFull()) { throw new IllegalStateException("Buffer is full"); } buf"See full answer

Yash G. - " import lombok.*; import lombok.extern.slf4j.Slf4j; import org.springframework.boot.CommandLineRunner; import org.springframework.boot.SpringApplication; import org.springframework.boot.autoconfigure.SpringBootApplication; import org.springframework.stereotype.Component; import org.springframework.stereotype.Repository; import org.springframework.stereotype.Service; import java.util.*; import java.util.concurrent.ConcurrentHashMap; import java.util.concurrent.ConcurrentMap; import java."See full answer

Sarvesh G. - "def calc(expr): ans = eval(expr) return ans your code goes debug your code below print(calc("1 + 1")) `"See full answer

Gomathi S. - "I product manage customer care - while I belong to the ecommerce platform team. customer care is not a direct contributor for revenue and the feedback i received during my career progression was unless i contribute to revenue i cannot be on promotion track. this is difficult feedback to act on as its not by job responsibility. worked with my manager on 2 fronts - 1) create a succession plan so i can take on additional responsibility that contributes to revenue and 2) create a plan on how care ca"See full answer

Ash I. - "Follow STAR Example: In my most recent role at x, we've been working every quarter to set our quarterly goals or even decide for the year but given in 2022 we've been through a great resignation phase there was a high attrition because of which we have overloaded engineering teams. During last quarterly planning, I started to question with my manager about giving a focus to our engineering, so we complete one thing absolutely fine which is more impactful for our customers and add immediate val"See full answer

GalacticInterviewer - "Approach 1: Use sorting and return the kth largest element from the sorted list. Time complexity: O(nlogn) Approach 2: Use max heap and then select the kth largest element. time complexity: O(n+logn) Approach 3: Quickselect. Time complexity O(n) I explained my interviewer the 3 approaches. He told me to solve in a naive manner. Used Approach 1 had some time left so coded approach 3 also The average time complexity of Quickselect is O(n), making it very efficient for its purpose. However, in"See full answer

TreeOfWisdom - "Should this question be BST, not just BT? Otherwise it would not be possible to reconstruct the tree solely based on the array regardless of its order"See full answer

Arturo Z. - "function insertItem(heap, item) { heap.push(item); if (heap.length > 0) { let current = heap.length - 1; while(current > 0 && heap[Math.floor(current/2)] > heap[current]) { [heap[Math.floor(current/2)], heap[current]] = [heap[current], heap[Math.floor(current/2)]]; current = Math.floor(current/2); } } } function extractMin(heap) { let smallest = heap[0]; let len = heap.length; if (len > 2) { heap[0] = heap[len - 1]; heap.splice(len - 1); "See full answer

Rahul J. - "find total sum. assign that to rightsum traverse from left to right: keep updating left sum and right sum, when they match return the index. else if you reach end return -1 or not found"See full answer

Guilherme F. - "A much better solution than the one in the article, below: It looks like the ones writing articles here in Javascript do not understand the time/space complexity of javascript methods. shift, splice, sort, etc... In the solution article you have a shift and a sort being done inside a while, that is, the multiplication of Ns. My solution, below, iterates through the list once and then sorts it, separately. It´s O(N+Log(N)) class ListNode { constructor(val = 0, next = null) { th"See full answer

Amparo L. - "I'm currently a School Bus Monitor at First Student, I make sure that the students on the bus are seated down, making sure they are safe during the bus ride. Sometimes depending on the day they may need me to help do a wheelchair so I sometimes help the driver out with making sure the wheelchair is safely secure, hooking up the 4 hooks on the wheelchair, putting the lap belt on the student and also making sure the student feels comfortable during the bus ride. After we finished dropping off our"See full answer

Anonymous Mongoose - "Given a Binary Tree, the task is to find its vertical traversal starting from the leftmost level to the rightmost level. If multiple nodes pass through a vertical line, they should be printed as they appear in the level order traversal of the tree. The idea is to traverse the tree using dfs and maintain a hashmap to store nodes at each horizontal distance (HD) from the root. Starting with an HD of 0 at the root, the HD is decremented for left children and incremented for right children. As we"See full answer

Anonymous Salamander - "Microservices are small parts of a application we can deploy them seprately and use them as a application feature."See full answer

S R. - "Did pretty ok. Gathered requirements, back of the envelope calculations and drew out the typical system design with details of components. Dug in deep into each box and probed around why it was needed."See full answer