Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Oct 2024. There were 4 interview rounds.
Consist 3 coding questions medium level
Design patterns in Java are reusable solutions to common problems in software design.
Design patterns help in creating flexible, maintainable, and scalable code.
Some common design patterns in Java include Singleton, Factory, Observer, and Strategy.
Each design pattern has its own purpose and can be applied in different scenarios.
Design patterns promote code reusability and help in organizing code in a structured manner.
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Basic questions of dbms ,os
To delete the middle node of a linked list, we can iterate through the list to find the middle node and then remove it by adjusting the pointers.
Iterate through the linked list to find the middle node by using two pointers - one moving one node at a time and the other moving two nodes at a time.
Once the middle node is found, adjust the pointers to skip over the middle node and connect the nodes before and after it.
Hand...
Dsa questions asked and java basic questions
Zopsmart Technology interview questions for designations
I applied via Campus Placement and was interviewed in Aug 2023. There were 3 interview rounds.
We were to make a go Lang api using one of the frameworks the company has made named go-fr
Aptitude test such as profit and loss , blood relations
Questions on string and map
I applied via Recruitment Consulltant and was interviewed in Oct 2022. There were 4 interview rounds.
The aptitude test was in online mode. There were 20 mcq questions and 5 coding questions ranging from easy to hard
After the Aptitude test, the gd was kept in offline mode ( at office ), the topic was "the pros and cons of online classes
I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.
Top trending discussions
I was interviewed before Sep 2020.
Round duration - 180 minutes
Round difficulty - Medium
The online test consisted of 2 coding questions, 30 aptitude MCQs, 30 behavioral MCQs and 10 code snippets to debug. The coding questions were of medium level, aptitude MCQs were easy and the code snippets to debug was also of easy level. Each section had a time constraint.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Merge two sorted linked lists into a single sorted linked list without using additional space beyond constant space complexity.
Create a dummy node to start the merged list
Iterate through both linked lists and compare nodes to merge them in sorted order
Update the next pointers accordingly
Handle cases where one list is empty or both lists are empty
Return the head of the merged linked list
Consider a 2-dimensional grid 'GRID' with 'N' rows and 'M' columns in Ninjaland. Each cell in the grid has an associated cost. The goal is to determine the minimum path ...
The Minimum Path Sum Problem involves finding the minimum sum of costs along a path from the top-left to the bottom-right of a grid.
Use dynamic programming to calculate the minimum path sum by considering the costs of moving down or right at each cell.
Initialize a 2D array to store the minimum path sum values for each cell in the grid.
Iterate through the grid to calculate the minimum path sum for each cell based on the...
Round duration - 60 minutes
Round difficulty - Medium
My interview was at 9:00 am. The interview was conducted on Amazon Chime and my webcam was on. The interviewer also asked me to write the code on a document which can be edited by both me and the interviewer. The difficulty of the questions was of medium level. I was asked 3 coding questions along with 2 questions related to OOPS at the end. The interview ended with the discussion of one of my projects. The interviewer was good and also gave me hints wherever required.
You are given a string S
. Your task is to partition S
such that every substring of the partition is a palindrome. Your objective is to return all possible palindr...
Given a string, partition it into palindromes and return all possible configurations.
Use backtracking to generate all possible palindrome partitions
Check if each substring is a palindrome before adding it to the partition
Return all valid partitions as an array of strings
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S
without any separators. During this pro...
Find the missing number in a string of consecutive nonnegative integers.
Iterate through the string and check for missing numbers by comparing adjacent integers
If a missing number is found, return it as the output
Handle cases where there are multiple missing numbers or the string is invalid by returning -1
ACID properties in DBMS ensure data integrity and consistency.
Atomicity: All operations in a transaction are treated as a single unit of work, either all succeed or all fail.
Consistency: Database remains in a consistent state before and after the transaction.
Isolation: Transactions are isolated from each other until they are completed.
Durability: Once a transaction is committed, the changes made by it are permanent and...
Tip 1 : You must have a grip over Data Structures and algorithms. Your concepts must be crystal clear. Pick one coding platform and try to practice at least 7-10 coding questions everyday. I completed around 200+ questions on Leetcode, 200+ questions on Geek For Geeks and around 30-40 questions on InterviewBit.
Tip 2 : After attempting any coding problem, analyze its time and space complexity. See, if you can further optimize your solution. You can always check the editorials and compare your solution with it.
Tip 3 : Apart from coding questions keep studying concepts of Operating Systems, databases and object oriented programming. You can always refer to Geeks For Geeks articles for it. Also, Coding Ninja's Data Structures and algorithms course in C++ helped me a lot in improving my OOPS concepts specifically.
Tip 1 : You do not need to have a long list of projects on your resume. One good project with proper knowledge of it will do good. Similarly, do not list down several number of skills. Few skills but roper knowledge of them are enough.
Tip 2 : Do not fake anything on your resume. The interviewer gets to know about it by asking questions. If you aren't able to answer, it leaves a negative impact.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedbased on 10 interviews
1 Interview rounds
based on 12 reviews
Rating in categories
Software Engineer
85
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
83
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
74
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Amazon
Paytm Mall
Snapdeal