Filter interviews by
I applied via Job Fair and was interviewed before Jun 2021. There were 2 interview rounds.
4 questions in 1 hour 30 minutes
Subset sum problem is a classic algorithmic problem in computer science.
The problem asks to find if there is a subset of the given array that sums up to a given target value.
It can be solved using dynamic programming or backtracking.
The time complexity of the dynamic programming solution is O(n*target), where n is the size of the array.
The problem can be further optimized using memoization or by using a boolean array t
Top trending discussions
I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jan 2021. There were 2 interview rounds.
Good
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Company Website and was interviewed before Jun 2020. There was 1 interview round.
I was interviewed before Dec 2020.
Round duration - 45 minutes
Round difficulty - Hard
All mcqs should answer with in time limit should have a lot of practice to solve in exam
You have two water jugs with capacities X
and Y
liters respectively, both initially empty. You also have an infinite water supply. The goal is to determine if it is possible to...
The Water Jug Problem involves determining if a specific amount of water can be measured using two jugs of different capacities.
Start by considering the constraints and limitations of the problem.
Think about how the operations allowed can be used to reach the target measurement.
Consider different scenarios and test cases to come up with a solution.
Implement a function that takes the capacities of the jugs and the targe...
Round duration - 60 minutes
Round difficulty - Easy
Easy and just basic questions very easy round
Given two sparse matrices MAT1
and MAT2
of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...
Implement a function to multiply two sparse matrices and return the resulting matrix.
Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication.
Iterate through the non-zero elements of the matrices to perform the multiplication efficiently.
Ensure to handle the sparse nature of the matrices to optimize the multiplication process.
Consider the constraints provided to en...
Tip 1 : preapre core subjects
Tip 2 : be confident and answer clearly
Tip 3 : be strong with projects
Tip 1 : good projects in ml and ai
Tip 2 : practical experience
I applied via Walk-in and was interviewed in Jul 2020. There was 1 interview round.
Python is a high-level programming language known for its simplicity and readability.
Python was created by Guido van Rossum and first released in 1991.
It is an interpreted language, which means it does not need to be compiled before running.
Python has a large standard library and a vast ecosystem of third-party packages.
It supports multiple programming paradigms, including procedural, object-oriented, and functional pr...
I applied via Naukri.com and was interviewed before Feb 2020. There were 3 interview rounds.
Quicksort has an average and best-case time complexity of O(n log n) and worst-case of O(n^2).
Quicksort is a divide-and-conquer algorithm that recursively partitions an array into two sub-arrays based on a pivot element.
The average and best-case time complexity is O(n log n) because each partition divides the array into roughly equal halves.
The worst-case time complexity is O(n^2) when the pivot element is the smallest...
Technical Solutions Engineer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Engineer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Solution Architect
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Technical Solutions Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Solutions Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Cloudera
Hortonworks
MapR Technologies
Snowflake