i
Axtria
Filter interviews by
I was interviewed in Aug 2016.
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
Code to reverse a binary search tree (BST)
Traverse the BST in post-order
Swap the left and right child of each node
Return the root node of the reversed BST
To create a pointer array of strings:
Declare a pointer array variable with the desired size
Allocate memory for each string in the array using malloc
Assign the memory address of each string to the corresponding array element
posted on 25 Sep 2024
Clustering in Cassandra involves grouping together multiple nodes to improve performance, scalability, and fault tolerance.
Clustering is used to distribute data across multiple nodes in a Cassandra cluster.
It helps in achieving high availability and fault tolerance by replicating data across nodes.
Cassandra uses consistent hashing to determine which node will store a particular piece of data.
Data is partitioned into sm...
Transactions in Spring Boot help manage database operations as a single unit of work.
Transactions ensure ACID properties (Atomicity, Consistency, Isolation, Durability) for database operations.
Use @Transactional annotation to mark a method as transactional.
Transactions can be managed programmatically using TransactionTemplate.
Rollback can be triggered manually in case of exceptions.
Spring Boot supports both declarative
Number of islands in a matrix
Design data recovery system
I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.
I applied via Referral and was interviewed before Dec 2023. There were 2 interview rounds.
Load balancers distribute incoming network traffic across multiple servers to ensure no single server is overwhelmed.
Load balancers monitor the health of servers and distribute traffic based on predefined algorithms.
They can be hardware-based or software-based.
Common algorithms used by load balancers include round-robin, least connections, and IP hash.
Load balancers can improve reliability and scalability of a website ...
The Two Sum problem involves finding two numbers in an array that add up to a target value.
Iterate through the array and store the difference between the target and current element in a hashmap.
Check if the current element exists in the hashmap, if yes, return the indices of the current element and the stored difference.
Time complexity of O(n) can be achieved by using a hashmap to store elements and their indices.
based on 1 review
Rating in categories
Senior Associate
873
salaries
| ₹9.5 L/yr - ₹22.7 L/yr |
Associate
660
salaries
| ₹7.5 L/yr - ₹18 L/yr |
Project Lead
615
salaries
| ₹13 L/yr - ₹27.6 L/yr |
Analyst
470
salaries
| ₹6 L/yr - ₹17.6 L/yr |
Data Analyst
239
salaries
| ₹5 L/yr - ₹18.3 L/yr |
Mu Sigma
Fractal Analytics
Tiger Analytics
LatentView Analytics