SDE - 2

Given an array 'A' consisting of 'N' integers, find the smallest subarray of 'A' containing exactly 'K' distinct integers.

Note :

If more than one such contiguous subarrays exist, consider the subarray having the smallest leftmost index.

For example - if A is [1, 2, 2, 3, 1, 3 ] and k = 2 then the subarrays: [1,2], [2,3], [3,1], [1,3] are the smallest subarrays containing 2 distinct elements. In this case, we will consider the starting and ending index of subarray [1,2] i.e. 0 and 1.

Design and code publisher subscriber based messaging queue supporting following features:
1. New topic creation
2. Multiple consumer subscriptions to a topic
3. Multiple producer threads writing to a topic
4. Topic message rewind (maintain commit logs)

You are given a 'N' * 'N' maze with a rat placed at 'MAZE[0][0]'. Find and print all paths that rat can follow to reach its destination i.e. 'MAZE['N' - 1]['N' - 1]'. Rat can move in any direc­tion ( left, right, up and down).

Value of every cell in the 'MAZE' can either be 0 or 1. Cells with value 0 are blocked means the rat can­not enter into those cells and those with value 1 are open.

I was required to describe a typical stock exchange system design.
He asked me to begin with defining API contracts. Problem was open ended. Started with clarifying the scope and did basic scale calculations. Only then begin with defining API contract.
Had a discussion on data structures to be used to support core logic. Then jumped to defining database schema.
Finally had some high level design discussion on scaling the system and database partition rebalance strategies.

1. Brief description of past work.
2. Recent challenging bug/issue solved.
3. Design description of one of the projects.
4. SDLC, tooling, agile related discussions.