cost of thread sleep on the critical section, cost of context switching, the benefit of spinlock? critical section spin locks mechanism.
Software Development Engineer Iii Interview Questions
293 software development engineer iii interview questions shared by candidates
Had round of interviews with 1) HR, 2) Hiring manager, 3) Behavioral, 4) Scrum Master , 5) Coding & 6) Product owner
How do you remove duplicates in integer array without using any java util framewworks?
Round one - two leetcode easy-medium questions Round two - two leetcode easy-medium questions Round three - technical/ managerial round. One coding question Round 4 - HR round/ salary discussion
All interviews involved describing your background and answering some basics about software testing approach. All technicals involved your average leetcode easy type of question. Especially ones that are open to optimization, using a hashmap, etc. One of the interviews had two logic questions. Final interview was asked about the difference between unit testing and integration testing.
You are given an array `board` of length N, describing subsequent positions on a game board from left to right. Every position is either empty (represented by 0 in the array) or contains a single game piece (represented by 1). Each game piece can be moved at most once. A move means going one or more positions to either the left or the right. Pieces cannot capture (occupy another piece's position) or jump over each other. When the game piece is moved by X positions (either left or right), we say it travels distance X. Also, pieces can be moved in any order, but they must be moved only one at a time. What is the maximum possible distance that the game pieces can travel altogether? Examples: [1, 1, 0, 0, 1] = 4; [0, 1] = 1; [0, 0, 0] = 0 N is an integer within [1..40000]. `board` only contains integers within [0..1].
coding related to data structures (stack) then questions on ETL pipelines, SQLs
describe how a red/black tree works.
Algorithm question: To print n by m dimensional matrix in spiral way.
1. Data Structure 2. Distributed computing, designing your own image distribution service 3. How to save billions of images with fast lookup 4. Binary Search Tree
Viewing 111 - 120 interview questions