Filter interviews by
An array is a collection of elements identified by index or key, with types including single-dimensional and multi-dimensional arrays.
Arrays can store multiple values in a single variable, e.g., ['apple', 'banana', 'cherry'].
Single-dimensional arrays hold a list of items, e.g., ['red', 'green', 'blue'].
Multi-dimensional arrays can represent matrices or grids, e.g., [['a', 'b'], ['c', 'd']].
Arrays can be of different ty...
Top trending discussions
I applied via Approached by Company and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.
posted on 20 Apr 2022
I applied via Recruitment Consulltant and was interviewed before Apr 2021. There was 1 interview round.
NoSQL databases are non-relational databases that store and retrieve data in a non-tabular format.
Document-oriented databases (MongoDB, Couchbase)
Key-value stores (Redis, Riak)
Column-family stores (Cassandra, HBase)
Graph databases (Neo4j, OrientDB)
Scaling refers to the process of increasing or decreasing the capacity of a system to handle more or less load.
Vertical Scaling: Adding more resources to a single node
Horizontal Scaling: Adding more nodes to a system
Load Balancing: Distributing the load across multiple nodes
Database Sharding: Splitting a database into smaller parts to distribute the load
Caching: Storing frequently accessed data in memory for faster acc...
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
I applied via LinkedIn and was interviewed before Jun 2021. There were 5 interview rounds.
Its a simple hackathon MCQ questions based on your skills.
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
based on 1 interview experience
based on 8 reviews
Rating in categories
Assistant Manager
92
salaries
| ₹4.2 L/yr - ₹9.7 L/yr |
Key Account Manager
90
salaries
| ₹2.7 L/yr - ₹5.8 L/yr |
Business Manager
89
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Senior Executive
83
salaries
| ₹2.5 L/yr - ₹6 L/yr |
Senior Software Engineer
78
salaries
| ₹8.7 L/yr - ₹15.4 L/yr |
ITC Infotech
CitiusTech
HTC Global Services
Xoriant