1. Orange Cutting (Grid Simulation / BFS-Style) — 40 words
Given an m×n grid where each cell has an orange with size. Cutting horizontally or vertically splits it into smaller valid pieces. Return the minimum number of cuts to make all pieces ≤ k. Use BFS/DP over states tracking segment sizes.
2. Priority Queue Scheduling — 40 words
You get tasks with arrival time and processing time. Only one task runs at a time; always pick available task with smallest processing time using a min-heap. Return order of execution. Use sorting + priority queue
Questions d'entretien [1]
Question 1
1. Orange Cutting (Grid Simulation / BFS-Style) — 40 words
Given an m×n grid where each cell has an orange with size. Cutting horizontally or vertically splits it into smaller valid pieces. Return the minimum number of cuts to make all pieces ≤ k. Use BFS/DP over states tracking segment sizes.
2. Priority Queue Scheduling — 40 words
You get tasks with arrival time and processing time. Only one task runs at a time; always pick available task with smallest processing time using a min-heap. Return order of execution. Use sorting + priority queue
Interview includes 2 coding rounds, 1 system design round, and STAR-based behavioral questions. Focus on DSA, especially graphs and trees. Also prepare Gmail filtering, timestamp-based filtering, and related implementation concepts.
Questions d'entretien [1]
Question 1
Graphs trees star based questions filtering of emails and timestamps
I attended an SDE 1 interview at Amazon. The interviewer focused on data structures, algorithms, and problem-solving. I explained my approach clearly, optimized my solution, answered behavioral questions, and gained valuable interview experience.
Asked for intro, then 2 dsa question and 1 question on lp. Explain your thought process and start with brute force dry run it explain its tc and sc and theb jump on to optimised solution