i
Zycus Infotech
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2023. There were 4 interview rounds.
It was quite difficult there was questions regarding probability and numbers system
It was easy compared to other rounds
Based on quants mostly simple interest profit and loss
Top trending discussions
posted on 14 May 2024
I applied via Company Website and was interviewed before May 2023. There were 2 interview rounds.
General aptitude’s with basic question of reasoning
Business development case study
OREPRE WELL PREPARE WELL PREPARE WELL PREPARE WELL
Guesstimate the design of a product.
Consider the purpose and functionality of the product.
Analyze similar existing products in the market.
Take into account user preferences and feedback.
Consider the materials, manufacturing processes, and cost constraints.
Iterate and refine the design based on feedback and testing.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
The test consists of 3 coding questions ranging from medium to high.
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Assign subjects contiguously to minimize maximum workload
Determine the minimum possible time required for the most loaded friend
Example: N=4, K=2, subjects={50, 100, 300, 400} -> Output: 400
Round duration - 30-40 minutes
Round difficulty - Medium
This was a technical interview first round which was based on Machine Learning, Deep Learning, Data Structures, and other computer science fundamentals.
In Machine Learning, they asked me regarding error functions, loss functions, overfitting, techniques to overcome overfitting, underfitting and techniques to handle missing values in the dataset. The next question was coding one and the question was to find the maximum element in the array in the window of size k.( gave solution starting from bruit force to Optimized one)
You are provided with an array A
containing N
integers. Your task is to determine the maximum element in every contiguous subarray of size K
as you move from left to rig...
Find the maximum element in every contiguous subarray of size K as you move from left to right through the array.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Pop elements from the deque that are out of the current window.
Keep track of the maximum element in each window and output the results.
Round duration - 30-40 minutes
Round difficulty - Medium
This was my technical round 2.
Given a binary matrix of size N * M
where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Consider all 4 possible directions to move from a cell: up, down, left, right.
Round duration - 30-40 minutes
Round difficulty - Medium
This was my technical round 3.The interviewer started with very basic maths questions like what is an eigenvalue, eigenvector, the inverse of a matrix, Does inverse exist for the rectangular matrix?
After that, he switched to the coding question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and updates.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the order of keys in the linked list whenever a k
Round duration - 30 minutes
Round difficulty - Easy
This is a cultural fitment testing round .
Tip 1 : Have atleast one internship in Data science or ML domain...Will help you to gain exposure
Tip 2 : Do good practice of advanced data structures like Tries,graphs etc.
Tip 3 : Be good in your communication
Tip 1 : Keep your resume up to date and mention three or four good level projects which will give a good impression to the interviewer
Tip 2 : You should be well aware and knowledgeable about all the things that are mentioned in your resume.
I applied via Naukri.com and was interviewed before Sep 2021. There were 2 interview rounds.
Quantitative reasoning questions probability, permutations combinations, data interpretation and other important topics.
I applied via Campus Placement
Math + Probability
Basic Aptitude questions over two rounds.
I applied via Company Website and was interviewed before Jul 2020. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.
based on 2 interviews
Interview experience
Software Engineer
285
salaries
| ₹3 L/yr - ₹8.6 L/yr |
Procurement Analyst
139
salaries
| ₹3 L/yr - ₹8 L/yr |
Associate Technical Leader
95
salaries
| ₹4.5 L/yr - ₹12.5 L/yr |
Softwaretest Engineer
94
salaries
| ₹3 L/yr - ₹7 L/yr |
Senior Procurement Analyst
85
salaries
| ₹4.1 L/yr - ₹10.4 L/yr |
Oracle Cerner
Thomson Reuters
Temenos
Chetu