Filter interviews by
I applied via Naukri.com and was interviewed before Oct 2022. There were 3 interview rounds.
Reverse string code and reverse array code
Inheritance is a mechanism in object-oriented programming where a class inherits properties and behaviors from another class.
Allows a class to inherit attributes and methods from another class
Promotes code reusability and reduces redundancy
Creates a parent-child relationship between classes
Example: Class 'Car' can inherit from class 'Vehicle' and inherit properties like 'speed' and methods like 'drive()'
Encapsulation is the concept of bundling data and methods that operate on the data into a single unit, known as a class.
Encapsulation helps in hiding the internal state of an object and restricting access to it.
It allows for better control over the data by preventing direct modification from outside the class.
Access to the data is provided through methods, which can enforce validation rules and ensure data integrity.
Ex...
Polymorphism is the ability of a single function or method to operate on different types of data.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).
Example: Animal superclass with Dog and Cat subclasses. Both Dog and Cat can be treated as Animals.
Abstraction is the concept of hiding complex implementation details and showing only the necessary features to the user.
Abstraction allows developers to focus on what an object does rather than how it does it
It helps in reducing complexity and improving code readability
Example: In Java, abstract classes and interfaces are used to achieve abstraction
Interview questions for Software Developer related to Spring, Collections, Serialization, Exceptions, Unix, Annotations, Json, Build tools, Restful services, and more.
List and Set are both collection interfaces in Java. List allows duplicates and maintains insertion order while Set doesn't allow duplicates and doesn't maintain any order.
Sorted in Hashed Set means that the elements are stored in a sorted order based on ...
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Campus Placement
I appeared for an interview in Nov 2016.
Seeking better growth opportunities and challenges
Limited growth potential in current role
Desire to work on more challenging projects
Looking for a company with a better cultural fit
Relocating to a new area
based on 1 interview
Interview experience
Software Engineer
181
salaries
| ₹16.5 L/yr - ₹60 L/yr |
Senior Software Engineer
113
salaries
| ₹21.7 L/yr - ₹91 L/yr |
Software Developer
110
salaries
| ₹20 L/yr - ₹85 L/yr |
Sde1
56
salaries
| ₹28 L/yr - ₹86 L/yr |
Software Development Engineer II
42
salaries
| ₹26 L/yr - ₹96 L/yr |
Salesforce
Amazon
Oracle