Recent Software Engineer Interview Questions

Anonymous Stork - "You are working on a SaaS product that currently uses Basic Authentication (username/password) for API and application access. The security and compliance teams have mandated moving to a more secure, modern authentication mechanism — OIDC (OpenID Connect). Design the authentication system migration from Basic Authentication to OIDC. Discuss the architecture changes, the migration approach, and the rollout strategy. What are the technical challenges, impacts on customers, backward compatibility"See full answer

Guilherme M. - "Question: An array of n integers is given, and a positive integer k, where k << n. k indicates that the absolute difference between each element's current index (icurrent) and the index in the sorted array (isorted) is less than k (|icurr - isorted| < k). Sort the given array. The most common solution is with a Heap: def solution(arr, k): min_heap = [] result = [] for i in range(len(arr)) heapq.heappush(min_heap, arr[i]) "See full answer

Kiran M. - "I started off with developing microservices for the game and then incorporating kafka to make it scalable"See full answer

Karan K. - "2 Approaches: 1) The more intuitive approach is doing a multi-source BFS from all cats and storing the distance of closest cats. Then do a dfs/bfs from rat to bread. Time Complexity: O(mn + 4^L) where L is path length, worst case L could be mn Space Complexity: O(m*n) 2) The first approach should be fine for interviews. But if they ask to optimize it further, you can use Binary Search. Problems like "Finding max of min distance" or "Finding min of max" could be usually solved by BS. "See full answer

Otto yhoda A. - "Context: While working as a Senior Systems Engineer at Indra on a project for BBVA, I was primarily responsible for building ETLs and optimizing data pipelines using Spark and Scala. Action: During a critical deployment phase, our QA lead had to leave unexpectedly due to a personal emergency. With no one available to manage testing coordination, I volunteered to step in — even though it wasn’t my formal responsibility. I quickly reviewed the test cases, communicated with stakeholders, an"See full answer

Subbu P. - "#Python implementation for product of max sum subarray res = max(nums) # Maximum value in Array currMax, currMin = 1, 1 # Initiatlize currMax and currMin to 1 for n in nums: # iterating loop tmp = n * currMax # temp variable which is product of current max and iterated number currMax = max(n * currMax, n * currMin, n) # Max value re-calculated currMin = min(tmp, n * currMin, n) # Min value re-calculated res = max(currMax, res) # assign"See full answer

Anonymous Salmon - "Situation Action Result"See full answer

Sambangi C. - "#simple solution 1.firstly find the node in the bst (O(logn) time complexity it take) 2.now removing the node consists of 3 cases: 1.if the node is leaf (no children): (keep track of parent and do) parent.left or parent.right=NULL simply remove the node () 2.if(has one child) replace the node with its child 3.if has both childs we replace the node with either inorder predesor(max of left tree)or inorder succesor and remove the node wh"See full answer

Praveen K. - "I did not give the proper ans so gettting rejected"See full answer