Filter interviews by
I applied via Company Website and was interviewed in Jun 2024. There were 3 interview rounds.
3 questions, medium hard
I applied via campus placement at Thapar Institute of Engineering and Technology (TIET) and was interviewed in Jul 2023. There were 2 interview rounds.
There were 13 MCQ questions on DSA, 17 MCQ aptitude questions, and 2 coding questions.
Check if after interleaving strings s1 and s2, we get s3 as one of the answers.
Create a recursive function to check all possible interleavings of s1 and s2
Check if the current interleaving matches s3
Return true if a valid interleaving is found, false otherwise
Cluster indexing physically reorders the data on disk to match the index, while non-cluster indexing does not.
Cluster indexing physically reorders the data on disk to match the index structure, leading to faster retrieval of data.
Non-cluster indexing creates a separate data structure that points to the actual data, which may result in slower retrieval times.
Cluster indexing is typically used in primary keys, while non-...
Stack memory is used for static memory allocation and follows a Last In First Out (LIFO) structure, while heap memory is used for dynamic memory allocation and has a more flexible structure.
Stack memory is limited in size and is typically faster to access compared to heap memory.
Variables stored in stack memory have a fixed size determined at compile time, while variables in heap memory can have a size determined at ru...
A stable sort is a sorting algorithm that preserves the relative order of equal elements in the sorted output.
Stable sorts are useful when the original order of equal elements needs to be maintained.
Examples of stable sorting algorithms include Merge Sort, Bubble Sort, and Insertion Sort.
In a stable sort, if two elements have the same key value, their relative order in the original array is preserved in the sorted arra
Time complexity of insertion in a hashmap is O(1).
Insertion in a hashmap has a constant time complexity of O(1) on average.
This is because hashmaps use a hashing function to determine the index where the key-value pair should be stored.
Even in the worst-case scenario, where there are collisions, the time complexity is still O(1) due to techniques like chaining or open addressing.
Example: Inserting a key-value pair into...
Hashing is a process of converting input data into a fixed-size string of bytes using a hash function.
Hashing is used to securely store passwords by converting them into a hash value.
Hashing is used in data structures like hash tables to quickly retrieve data based on a key.
Common hash functions include MD5, SHA-1, and SHA-256.
I applied via Referral and was interviewed in Aug 2023. There were 2 interview rounds.
Leetcode practice should be sufficient to tackle this round.
Trapping Rain Water problem involves calculating the amount of water that can be trapped between buildings given their heights.
Calculate the maximum height of buildings to the left and right of each building
Find the minimum of the two heights
Subtract the height of the current building to get the amount of water that can be trapped at that building
I applied via Job Portal and was interviewed in Aug 2022. There were 4 interview rounds.
2 coding questions 10 aptitude and other 15 technical questions
Arcesium interview questions for designations
I applied via Referral and was interviewed before Jun 2023. There was 1 interview round.
2 Greedy Algo problems
Get interview-ready with Top Arcesium Interview Questions
I applied via Company Website and was interviewed in Apr 2021. There was 1 interview round.
posted on 10 Nov 2024
Developed a mobile app for tracking daily water intake
Researched existing water tracking apps for inspiration
Designed user interface for easy input of water consumption
Implemented backend database to store user data
Tested app with beta users for feedback and improvements
I applied via Naukri.com and was interviewed in Aug 2024. There were 2 interview rounds.
C and Golang related questions, 2 Hours assement, The test involved writing code by hand in paper in the office (Bengaluru)
Go code to remove duplicate elements from a slice of strings
Use a map to keep track of unique elements
Iterate over the slice and add elements to the map
Create a new slice with unique elements from the map
Arrays have fixed length, slices are dynamic and can grow/shrink. Slices are references to arrays.
Arrays have fixed length, specified at compile time.
Slices are dynamic, can grow or shrink at runtime.
Slices are references to arrays, allowing for more flexibility.
Example: var arr [3]string // array with fixed length of 3
Example: slice := make([]string, 0) // slice with dynamic length
Struct is a user-defined data type that groups related data fields together. Interface defines a set of methods that a type must implement.
Struct is used to create complex data structures by grouping related data fields together.
Interface defines a set of methods that a type must implement. It allows for polymorphism in Go.
Example: type Person struct { Name string; Age int }
Example: type Shape interface { Area() float6...
Containerization is a method of packaging, distributing, and running applications in isolated environments called containers.
Containers are lightweight, portable, and can run on any platform that supports containerization.
They include everything needed to run the application, such as code, runtime, system tools, libraries, and settings.
Popular containerization tools include Docker, Kubernetes, and Podman.
Containerizati...
Implementing a struct in Go code
Define a struct using the 'type' keyword
Add fields to the struct with their respective data types
Access struct fields using dot notation
Goroutine is a lightweight thread managed by Go runtime, allowing concurrent execution of functions.
Goroutines are created using the 'go' keyword in Go programming language.
They are more lightweight than threads and are managed by the Go runtime.
Goroutines allow for concurrent execution of functions without the need for manual thread management.
Example: go myFunction()
Example: go func() { // code here }
Concurrency in Go is achieved using goroutines and channels.
Use goroutines to run functions concurrently
Communicate between goroutines using channels
Avoid using shared memory for synchronization
A channel in Go is a communication mechanism that allows goroutines to communicate with each other.
Buffered channels have a specific capacity and can send multiple values without the need for a corresponding receive operation immediately.
Unbuffered channels have no capacity and require both a send and receive operation to be ready at the same time for communication to occur.
Scaling refers to the ability of a system to handle increasing amounts of work or its potential to accommodate growth.
Horizontal scaling involves adding more machines to distribute the load, while vertical scaling involves increasing the resources of a single machine.
Horizontal scaling is more cost-effective and provides better fault tolerance, but can be more complex to implement.
Vertical scaling is simpler to impleme...
I applied via Walk-in and was interviewed in Nov 2024. There was 1 interview round.
An array is a data structure that stores a collection of elements of the same data type.
Arrays are used to store multiple values in a single variable.
Elements in an array are accessed by their index, starting from 0.
Example: String[] names = {"Alice", "Bob", "Charlie"};
Data structures are used to organize and store data efficiently in computer memory.
Data structures help in efficient data retrieval, insertion, and deletion operations.
Examples include arrays, linked lists, stacks, queues, trees, and graphs.
Each data structure has its own advantages and use cases based on the requirements of the application.
For example, arrays are used for random access to elements, while linked lists
1 Interview rounds
based on 13 reviews
Rating in categories
Analyst
298
salaries
| ₹7.6 L/yr - ₹19 L/yr |
Senior Analyst
292
salaries
| ₹9.5 L/yr - ₹29.5 L/yr |
Senior Software Engineer
232
salaries
| ₹15 L/yr - ₹42 L/yr |
Software Engineer
148
salaries
| ₹11.9 L/yr - ₹33.5 L/yr |
Financial Analyst
148
salaries
| ₹8.5 L/yr - ₹19 L/yr |
Edelweiss
JPMorgan Chase & Co.
Goldman Sachs
Morgan Stanley