Filter interviews by
I applied via Company Website and was interviewed in Oct 2024. There was 1 interview round.
There is 2 major Coding Questions using lot of major languages
Top trending discussions
posted on 10 Nov 2019
I applied via Company Website and was interviewed in Nov 2019. There was 1 interview round.
Deleting the Kth node in a linked list.
Traverse the linked list to the Kth node.
Update the previous node's next pointer to skip the Kth node.
Free the memory allocated to the Kth node.
Handle edge cases such as deleting the head or tail node.
Reverse a linked list n times
Create a function to reverse a linked list
Loop through the linked list n times and reverse it each time
Return the final reversed linked list
A dictionary is a collection of key-value pairs in Python.
Keys must be unique and immutable.
Values can be of any data type.
Access values using keys.
Add or modify values using keys.
Delete key-value pairs using del keyword.
I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.
1 hr test on HackerEarth platform, DSA questions
I applied via Telegram and was interviewed in Dec 2023. There were 2 interview rounds.
The job culture at Zopsmart is collaborative, innovative, and fast-paced.
Collaborative work environment where team members support and help each other
Emphasis on innovation and creativity in problem-solving
Fast-paced atmosphere with opportunities for growth and learning
Open communication and feedback encouraged
Diverse and inclusive workplace culture
Medium level leetcode problem
posted on 6 Jun 2023
I applied via Referral and was interviewed before Jun 2022. There were 2 interview rounds.
Cloud technologies offer different services like IaaS, PaaS, and SaaS for varying levels of control and management.
IaaS (Infrastructure as a Service) provides virtualized computing resources over the internet, such as virtual servers and storage.
PaaS (Platform as a Service) offers a platform allowing customers to develop, run, and manage applications without dealing with infrastructure.
SaaS (Software as a Service) deli...
posted on 30 Apr 2024
I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 3 interview rounds.
There was coding test
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them separately, and then merges them back together in sorted order.
Divide the input array into two halves
Recursively sort each half
Merge the sorted halves back together
I applied via Walk-in and was interviewed before Aug 2023. There were 2 interview rounds.
It was deciphering spoken language to subtitle for a complicated accented show
I am passionate about the company's mission and values, and I believe my skills and experience align well with the opportunities here.
Passionate about company's mission and values
Skills and experience align well with opportunities
Excited about potential for growth and development
I am passionate about using data analysis to drive business decisions and improve processes.
I have always been fascinated by the power of data to uncover insights and drive strategic decision-making.
I enjoy working with large datasets and using statistical tools to extract meaningful information.
I believe that data-driven decision-making is crucial for businesses to stay competitive in today's market.
For example, in my...
posted on 16 Dec 2024
It was a Basic Aptitude Test
We were asked to do Sorting, SQL queries (join)
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
5 years of experience in software development
Proficient in developing web applications
Skilled in using various technologies such as Java, JavaScript, and SQL
I applied via Referral and was interviewed before Jul 2021. There were 2 interview rounds.
Use Fisher-Yates shuffle algorithm to play songs randomly without repetition.
Create an array of songs
Use Fisher-Yates shuffle algorithm to shuffle the array
Play the first song in the shuffled array
Remove the first song from the array
Repeat steps 3-4 until all songs have been played
Reverse a linked list
Iterate through the linked list and change the direction of the pointers
Keep track of the previous, current, and next nodes
Set the head of the linked list to the last node after reversing
Hashing algorithm to count maximum number of 1s in a 2D matrix.
Create a hash table to store the count of 1s in each row.
Traverse through each row and update the count in the hash table.
Find the row with the maximum count of 1s in the hash table.
Return the count of 1s in that row.
based on 1 interview
Interview experience
Software Development Engineer II
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
CodeChef
LeetCode
GeeksForGeeks
InterviewBit