Axtria Data Engineer Interview Questions and Answers

Q1. Basic Question of mySQL like inner join,left join,right join,outer join.
Add your answer
Q2. Windows function in MySQL and Basic DSA question on implementation of heap sort
Add your answer

Coding round of 2 questions of medium level

Normal online code / frontend test

Q1. How would you build book my show
Ans. 
Designing and building a platform similar to BookMyShow involves creating a user-friendly interface for booking tickets for various events.
• Develop a user-friendly website and mobile app for users to browse and book tickets for movies, concerts, plays, etc.

• Implement a secure payment gateway for users to make online transactions.

• Integrate a database to store information about events, venues, tickets, and user bookings.

• In...read more
Answered by AI
Add your answer

Q1. Solid principals, awareness of patterns
Add your answer

Q1. How would you build tinyurl like service, systems designs
Ans. 
To build a tinyurl-like service, design a system with a URL shortening algorithm, a database to store mappings, and a redirect service.
• Use a hashing algorithm to generate short URLs from long URLs (e.g. MD5, SHA-256).

• Store the mappings of short URLs to long URLs in a database (e.g. MySQL, Redis).

• Implement a redirect service that takes a short URL, looks up the corresponding long URL in the database, and redirects the u...read more
Answered by AI
Add your answer

Q1. Non-technical questions
Add your answer

Q1. Easy array problem
Add your answer
Q2. Easy tree traversal problem
Ans. 
Implement tree traversal algorithm to visit each node in a tree structure
• Use depth-first search (DFS) or breadth-first search (BFS) to traverse the tree

• DFS can be implemented using recursion or a stack data structure

• BFS can be implemented using a queue data structure

• Example: Inorder traversal of a binary tree - left, root, right
Answered by AI
Add your answer

Q1. Trapping rain water
Add your answer
Q2. Path of longest sum
Ans. 
Find the path in a matrix with the longest sum of elements
• Start from the top-left corner of the matrix

• Move only right or down in the matrix

• Keep track of the sum of elements in each path

• Return the path with the longest sum
Answered by AI
Add your answer

Q1. Reverse the linked list.
Add your answer

Q1. Internel working of Hashmap
Add your answer

Q1. Salary Discussion
Add your answer