Filter interviews by
I applied via LinkedIn and was interviewed in Dec 2021. There were 3 interview rounds.
Object-oriented programming (OOP) is a paradigm based on objects that encapsulate data and behavior.
Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).
Inheritance: Mechanism to create a new class based on an existing class (e.g., a 'Dog' class inheriting from an 'Animal' class).
Polymorphism: Ability to present the same interface for different underlying data types (e.g., a...
Top trending discussions
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Numerical and logical aptitude test
There are 5 rounds on datastructure and algorithm
I applied via Referral and was interviewed in Sep 2021. There were 6 interview rounds.
Reliability refers to the ability of a system or component to perform its required functions under stated conditions for a specified period of time.
Reliability is a measure of how often a system or component fails and how quickly it can be restored to normal operation.
It is important to design systems with redundancy and failover mechanisms to ensure high reliability.
Reliability can be improved through regular maintena...
I appeared for an interview in Nov 2020.
Round duration - 135 minutes
Round difficulty - Easy
Coding questions was easy if you know the basic of coding in any language. I submitted optimized solution for every questions that's why i got selected in this round.
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...
Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.
Parse the encrypted string to extract substrings and their counts
Iterate through the substrings and counts to build the decrypted string
Track the position in the decrypted string to find the K'th character
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
Detect if an undirected graph contains a cycle.
Use Depth First Search (DFS) to traverse the graph and detect cycles.
Maintain a visited array to keep track of visited vertices.
If a visited vertex is encountered again during DFS, a cycle exists.
Check for back edges while traversing the graph.
Consider disconnected graphs as well.
Round duration - 150 minutes
Round difficulty - Medium
You are provided with an array ARR
consisting of N
distinct integers in ascending order and an integer TARGET
. Your objective is to count all the distinct pairs in ARR
whose sum...
Count distinct pairs in an array whose sum equals a given target.
Use two pointers approach to iterate through the array and find pairs with sum equal to target.
Keep track of visited pairs to avoid counting duplicates.
Return -1 if no such pair exists with the given target.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Given a palindrome number represented as a string, find the largest palindrome number that is strictly less than the given number.
Iterate from the middle towards the start and end of the string to find the next smaller palindrome.
If the number is odd in length, simply mirror the left half to the right half to get the next smaller palindrome.
If the number is even in length, decrement the middle digit and mirror the left...
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
The problem involves finding the length of the longest common subsequence between two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'a...
Round duration - 30 minutes
Round difficulty - Easy
Interview went well.The interviewer asked me how the previous interviews were.
Given a binary tree of integers, your task is to output the boundary nodes of this binary tree in Anti-Clockwise order, starting from the root node.
The b...
Output the boundary nodes of a binary tree in Anti-Clockwise order, starting from the root node.
Traverse the left boundary nodes in top-down order
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in bottom-up order
Combine the above traversals to get the boundary nodes in Anti-Clockwise order
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Maintain left pointer for 0s, right pointer for 2s, and current pointer for traversal.
Example: If current element is 0, swap it with element at left pointer and increment both pointers.
Round duration - 20 minutes
Round difficulty - Easy
This round is very easy, In this round they basically need confidence and truthful person.
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's.
Tip 2 : Do lot of hard work and practice of Data Structures and Algorithms based questions
Tip 3 : See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers.
Tip 4 : I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Tip 1 : Always try to make it a single page
Tip 2 : do mention all your skills which you are confident of in your resume.
Tip 3 : Always make resume company specific
I appeared for an interview in Nov 2020.
Round duration - 2 hours
Round difficulty - Medium
In the 1st round
Aptitude
Reasoning
English
Automata fix( code debug)
Timing in morning
Environment is good
Interviewer was very cool and interactive
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...
Implement a function to encode a text message using run-length encoding.
Iterate through the message and count consecutive characters
Append the character and its count to the encoded message
Handle edge cases like single characters or empty message
Round duration - 30 minutes
Round difficulty - Medium
This is interview round
Ques from basic electronics
C language
Create a class named Person
with a string variable 'name'
and an integer variable 'age'
, such that these variables are not accessible outside the class. Implement a me...
Create a class Person with private variables name and age, and methods to set and get their values.
Create a class Person with private variables 'name' and 'age'.
Implement a method setValue to set the variables' values.
Implement a method getValue to print the variables' values.
Ensure the name is a non-empty string and the age is a non-negative integer.
Encapsulate the data and provide a clear interface for setting and ge...
Tip 1 : Do aptitude from indiabix. Go through your basics. At least one language u know. Learn about your branch basics. Know concept of data structure and oops.
Tip 2 : prepare your final project well.
Tip 1 : the skills you know very well mention in resume
Tip 2 : mention project in resume
I applied via Naukri.com and was interviewed in Feb 2022. There were 2 interview rounds.
C , java
HTML
Aptitude and resume shortlist and HTML
I applied via Naukri.com and was interviewed before May 2021. There were 3 interview rounds.
Inner join returns only matching rows from both tables while outer join returns all rows from one table and matching rows from the other.
Inner join is used to combine data from two tables based on a common column.
Outer join is used to combine data from two tables where one table may not have matching rows in the other.
There are three types of outer join: left outer join, right outer join, and full outer join.
Left outer...
An abstract class is a class that cannot be instantiated and is used as a base class for other classes.
An abstract class can have abstract and non-abstract methods.
Abstract methods have no implementation and must be implemented by the derived class.
An abstract class can have constructors and fields.
An abstract class can be used to define a common interface for a group of related classes.
Example: Animal is an abstract c...
Normalization is a process of organizing data in a database to reduce redundancy and dependency.
Normalization is used to eliminate data redundancy and dependency.
3NF (Third Normal Form) eliminates transitive dependencies while BCNF (Boyce-Codd Normal Form) eliminates partial dependencies.
3NF is a subset of BCNF.
Normalization helps in improving data consistency and integrity.
Normalization can also improve database perfo...
based on 1 review
Rating in categories
Software Developer
10
salaries
| ₹1 L/yr - ₹6.8 L/yr |
Software Engineer
7
salaries
| ₹1.3 L/yr - ₹4 L/yr |
DOT NET Developer
5
salaries
| ₹2.2 L/yr - ₹3.5 L/yr |
Softwaretest Engineer
5
salaries
| ₹1.5 L/yr - ₹3.2 L/yr |
Java Developer
4
salaries
| ₹3 L/yr - ₹7.5 L/yr |
Cognizant
Teleperformance
iEnergizer
Reliance Retail