Target OA Completed on July 11th
Summary
I completed Target's online assessment on July 11th, which consisted of three algorithmic problems.
Full Experience
Anyone Completed the Target OA on july 11 for Cyber & Infra ->Backend Assessment.
Question Asked:
a. Find distance between two strings (delete, replace, insert) for Q queries and return minDis String from S strings.
b. Find LuckyNumbers from [l,r]. 1<= l,r <= 10^18 lucky numbers x are integers, which are divisible by floor(sqRoot(x)).
c. Synchronised ticket booking system where total N seats are available.
you return for Q queries first seat available, if not available -1; First available seat is assigned (assuming enough seats are there).
Please Let me know if anyone waiting for interview call.
#interview #oa #target
Interview Questions (3)
String Edit Distance for Multiple Queries
Given a set of S strings, answer Q queries where each query provides two strings. For each query, compute the minimum edit distance (using delete, replace, insert operations) between the two strings and return the string from S that yields the minimum distance.
Lucky Numbers in Range
Find all lucky numbers within the inclusive range [l, r] where 1 ≤ l, r ≤ 10^18. A lucky number x is defined as an integer that is divisible by floor(sqrt(x)).
Synchronized Ticket Booking System
Implement a ticket booking system for N seats. For each of Q queries, return the first available seat number. If no seats are available, return -1. When a seat is allocated, it becomes unavailable for subsequent queries.