i
Filter interviews by
I applied via Campus Placement
4 sections Quantitative Analysis, Programming Based (output analysis, error detection), Aptitude and ML Engineering ( activation functions, models etc basics)
Questions around general Maths, English, Decision making
I have a strong technical background, excellent problem-solving skills, and a proven track record of delivering high-quality software solutions.
I have a Bachelor's degree in Computer Science and X years of experience in software development.
I am proficient in multiple programming languages such as Java, Python, and JavaScript.
I have successfully led and delivered projects on time and within budget, showcasing my strong
I applied via Campus Placement and was interviewed in Apr 2024. There were 4 interview rounds.
Normal Quant , Aptitude And 3 coding questions
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
Aptitude questions and 2 coding questions were asked
Indexes in DBMS are data structures that improve the speed of data retrieval operations on a database table.
Indexes are used to quickly locate data without having to search every row in a table.
They are created on columns in a table to speed up SELECT queries.
Examples of indexes include primary keys, unique keys, and non-unique indexes.
ACID properties in DBMS refer to the key characteristics of a transaction: Atomicity, Consistency, Isolation, and Durability.
Atomicity ensures that all operations in a transaction are completed successfully or none at all.
Consistency ensures that the database remains in a consistent state before and after the transaction.
Isolation ensures that the execution of multiple transactions concurrently does not interfere with ...
Quantiphi Analytics Solutions Private Limited interview questions for designations
I applied via Campus Placement and was interviewed in Jul 2022. There were 4 interview rounds.
They asked various technology related questions such as ML, JS, OOPs, DBMS, OS etc
Top trending discussions
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...
OOPs stands for Object-Oriented Programming. It is a programming paradigm based on the concept of objects.
Advantages of OOPs include code reusability, modularity, flexibility, and easier maintenance.
Encapsulation allows data hiding and protection, reducing complexity and increasing security.
Inheritance enables code reuse and promotes the creation of hierarchical relationships between classes.
Polymorphism allows objects...
jQuery is a JavaScript library that simplifies HTML document traversal and manipulation, event handling, and animation.
jQuery is a fast, small, and feature-rich JavaScript library.
It makes things like HTML document traversal and manipulation, event handling, and animation much simpler with an easy-to-use API.
jQuery simplifies common tasks like AJAX calls and DOM manipulation.
JavaScript is a programming language that en...
Ecom is core platform
PHP is a server-side scripting language used for web development.
PHP stands for Hypertext Preprocessor.
It is open source and widely used for creating dynamic web pages.
Advantages include easy integration with HTML, support for various databases, and compatibility with different operating systems.
PHP code can be embedded within HTML code, making it easy to work with web content.
Popular websites like Facebook and WordPre
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.
based on 7 interviews
1 Interview rounds
based on 5 reviews
Rating in categories
Data Engineer
423
salaries
| ₹5 L/yr - ₹18 L/yr |
Senior Data Engineer
398
salaries
| ₹9 L/yr - ₹26.5 L/yr |
Senior Business Analyst
330
salaries
| ₹8 L/yr - ₹28 L/yr |
Business Analyst
318
salaries
| ₹6.5 L/yr - ₹14 L/yr |
Machine Learning Engineer
309
salaries
| ₹5 L/yr - ₹16 L/yr |
Fractal Analytics
Tiger Analytics
LatentView Analytics
Mu Sigma