eightfold.ai interview experience Real time questions & tips from candidates to crack your interview

Agentic AI Intern

eightfold.ai

3 rounds | 3 Coding problems

Anonymous

Fresher | Nov 2025

Rejected

Interview preparation journey

Journey

I was genuinely excited when I came across this Agentic AI role, as it aligned perfectly with my curiosity about how AI systems think, plan, and act. I started with the basics, understanding core concepts, exploring real-world use cases, and gradually moving toward more advanced ideas. I read research papers, followed practical blogs, and closely studied articles and updates from OpenAI. Since this field is rapidly evolving, staying curious and consistent helped me build clarity and confidence over time.

Application story

The opportunity came through an on-campus hiring process. After applying via the college placement portal, the selection process was conducted in multiple stages and focused on both technical evaluation and practical application. It included online assessments and a hands-on assignment, followed by further evaluations to assess problem-solving and coding skills. The entire process was well-structured and led up to the final interview.

Why selected/rejected for the role?

I reached the final stage but was rejected because I had not practiced DSA much, as I thought this role might not require it. I was unable to arrive at the most optimal solution.

Preparation

Duration: 6 months

Topics: AI Agents, RAG Pipelines, Python, Pydantic Library, Data Structures, Algorithms

Tip

Tip 1: For any role in an MNC, do not miss revising DSA.
Tip 2: Prepare your projects thoroughly.
Tip 3: Prepare your resume carefully.

Application process

Where: Campus

Eligibility: 8.5 CGPA, (Salary Package: 18 LPA)

Resume tip

Tip 1: Include projects that are aligned with the job description.
Tip 2: Prepare your projects thoroughly.

Interview rounds

Round

Medium

Online Coding Test

Duration45 minutes

Interview date12 Nov 2025

Coding problem1

The round involved a DSA problem presented by an AI interviewer. The question was read out, and I was asked to explain my approach interactively before writing the code. After coding, I explained the key parts of my solution, handled follow-up questions related to edge cases, and discussed the time complexity. The focus was on clarity of thought, problem-solving approach, and correctness of the solution.

1. Shortest Path with Discount

Easy

0/40

Asked in company

You are given a directed weighted graph with N nodes and M edges. The nodes are numbered from 1 to N. Each edge has a positive weight, representing the cost to travel between two nodes.

You have a special discount coupon that you can apply to at most one edge in the entire graph. This coupon reduces the weight of the chosen edge to half its value (using floor division, i.e., newweight = floor(originalweight / 2)).

Your task is to find the minimum possible cost to travel from the starting node 1 to the destination node N. You can choose to use the coupon on any single edge, or not use it at all if the original shortest path is already optimal.

Problem approach

Used a modified Dijkstra’s algorithm with state tracking.
Maintained two distances for each node: one without using the discount and one after using it.
At each edge, either moved normally or applied the discount if it had not been used earlier.
Used a priority queue to always expand the state with the minimum cost.
Took the minimum of both states at the destination as the final answer.

Try solving now

Round

Medium

Assignment

Duration50 minutes

Interview date21 Nov 2025

Coding problem1

1. AI Prep

Design an AI-based interactive platform for interview preparation.

Problem approach

Tip 1: Do good research about the problem statement.

Round

Medium

Face to Face

Duration60 minutes

Interview date3 Dec 2025

Coding problem1

There were two interviewers. The first interviewer asked me a DSA question, and the second asked me to walk through the code files for the assignment I had submitted. The interview was conducted in the afternoon.

1. Kth Smallest Element

Moderate

0/80

Asked in companies

You are given a square matrix ‘NxN’ rows and columns. The matrix is sorted, meaning all rows and columns of the matrix are sorted in ascending order. You are also given an integer ‘K’, and your task is to find the ‘K’th smallest element in the sorted order.

For example:

You are given ‘mat’ = [[1, 2, 2,], [3, 3, 4], [5, 6 ,7]]] and ‘K’ = 5, the elements of the matrix are [1, 2, 2, 3, 3, 4, 5, 6, 7], the 5th smallest element in the matrix is 3. Hence the answer is 3.

Problem approach

Used binary search on the answer space instead of flattening the matrix.
Set the search range from the smallest element (top-left) to the largest element (bottom-right).
For a mid value, counted how many elements in the matrix were ≤ mid by scanning each row efficiently.
If the count was less than k, moved the search to the right; otherwise, moved it to the left.
The value where the search converges gives the k-th smallest element.

Try solving now