Target OA Completed on July 11th

Posted
26 Jul 2026
94 reads

Summary

I completed Target's online assessment on July 11th, which consisted of three algorithmic problems.

How it went

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

Questions asked (3)

  1. 01

    String Edit Distance for Multiple Queries

    Data Structures & Algorithms

    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.

  2. 02

    Lucky Numbers in Range

    Data Structures & Algorithms

    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)).

  3. 03

    Synchronized Ticket Booking System

    Data Structures & Algorithms

    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.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Target recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!