Ananta Games Interview Questions and Answers

There were two coding questions; one was related to linked lists, and the other was linked to binary trees.

Q1. Can you elaborate on the project discussion you mentioned in your resume?
Ans. 
Developed a web application for tracking inventory and sales data
• Used React for front-end development

• Implemented RESTful APIs using Node.js and Express for back-end

• Utilized MongoDB for database management

• Integrated authentication and authorization features for secure access

• Implemented data visualization using Chart.js
Answered by AI
Add your answer
Q2. Can you provide the code to reverse a linked list?
Ans. 
Reversing a linked list involves changing the direction of pointers to go from the end to the beginning.
• Start by initializing three pointers: current, previous, and next.

• Iterate through the linked list, updating the pointers to reverse the direction of the links.

• Update the head of the linked list to point to the new first node, which was the original last node.
Answered by AI
Add your answer
Q3. Some questions were asked regarding the four pillars of Object-Oriented Programming (OOP)?
Add your answer
Q4. Questions related to pointers, dangling pointers.
Add your answer

Q1. Program for finding the perfect squares between two numbers.
Ans. 
Program to find perfect squares between two numbers
• Iterate through numbers between the given range

• Check if the square root of the number is an integer

• If yes, then it is a perfect square
Answered by AI
Add your answer
Q2. What are smart pointers in C++?
Ans. 
Smart pointers in C++ are objects that act like pointers but provide automatic memory management.
• Smart pointers help prevent memory leaks by automatically managing memory allocation and deallocation.

• Examples include unique_ptr, shared_ptr, and weak_ptr.

• unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to prevent circular references.
Answered by AI
Add your answer
Q3. What is mutual exclusion in the context of concurrent programming?
Ans. 
Mutual exclusion is a concept in concurrent programming where only one thread can access a shared resource at a time.
• Ensures that only one thread can access a critical section of code at a time

• Prevents race conditions and data corruption

• Commonly implemented using locks, semaphores, or mutexes

• Example: Using a mutex to protect a shared variable in a multi-threaded application
Answered by AI
Add your answer
Q4. What is the process for implementing multithreading?
Ans. 
Implementing multithreading involves creating and managing multiple threads to execute tasks concurrently.
• Identify the tasks that can be executed concurrently

• Create and manage multiple threads to execute these tasks simultaneously

• Use synchronization techniques like locks and semaphores to prevent race conditions

• Handle communication and coordination between threads

• Consider thread safety and resource sharing issues
Answered by AI
Add your answer

Basic aptitude test, if you know basic maths you can easily crack it.

SQL based leetcode medium and hackerrank

Python take home EDA case study assessment

Q1. Search in 2d matrix
Ans. 
Search for a target value in a 2D matrix efficiently.
• Use binary search on rows to find the potential row where the target value may exist.

• Then use binary search on that row to find the target value.
Answered by AI
Add your answer
Q2. Find quadraplets that sum to target
Ans. 
Find quadraplets in an array that sum up to a target value.
• Use a nested loop to iterate through all possible combinations of quadraplets.

• Keep track of the sum of each quadraplet and compare it to the target value.

• Return the quadraplets that match the target sum.
Answered by AI
Add your answer

Q1. Nth Greatest Element III (Leetcode)
Ans. 
Find the Nth greatest element in an array without sorting
• Use a priority queue to keep track of the N greatest elements

• Iterate through the array and add elements to the priority queue

• Return the top element from the priority queue as the Nth greatest element
Answered by AI
Add your answer
Q2. Heater Problem (Leetcode)
Ans. 
Heater Problem - Find minimum radius to cover all houses with heaters
• Sort the houses and heaters arrays

• For each house, find the closest heater using binary search

• Calculate the minimum radius needed to cover all houses
Answered by AI
Add your answer

Easy coding questions

Tough level questions , needed high level of thinking

Link list program, few objective based on cpp

Q1. Good Core knowledge cpp
Add your answer
Q2. Pointer, static , constant used in multiple scenario. Oops, STL
Add your answer