there are total 3-4 rounds held by talent acquistion team every round was offline no virtual rounds DSA , problem solving, is testedCore
SQL
Python
PySpark
Databricks
Azure
Plus
GenAI basics
RAG
LangChain
Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Data Axle (Pune) en may 2026
Entrevista
Coding round included medium-level DSA problems, followed by two technical interviews focused on problem-solving, projects, and fundamentals. The process ended with an HR interview covering communication skills, teamwork, and career goals.
Preguntas de entrevista [2]
Pregunta 1
Given an input string find the longest substring without duplicates.
String Compression Problem
Given an array of characters chars, compress it using the following algorithm:
Begin with an empty string s.
For each group of consecutive repeating characters in chars:
If the group's length is 1, append the character to s.
Otherwise, append the character followed by the group's length.
The compressed string s should not be returned separately, but instead be stored in the input character array chars.
Note that group lengths that are 10 or longer will be split into multiple characters in chars.
After modifying the input array, return the new length of the array.
You must write an algorithm that uses only constant extra space.