Filter interviews by
A simple Todo app to manage tasks and deadlines
Create a form to add new tasks
Display a list of tasks with checkboxes to mark as complete
Include options to edit or delete tasks
Implement functionality to mark tasks as complete or incomplete
Add a feature to filter tasks by status (completed/incomplete)
Top trending discussions
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Medium
Round duration - 20 minutes
Round difficulty - Medium
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Given an array and a target sum, find pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list. Otherwise, add the current element to the hash set.
Sort the pairs based on the first element and then the second element to meet the required output form
Round duration - 20 minutes
Round difficulty - Easy
Round duration - 40 minutes
Round difficulty - Hard
Pointers in C/C++ are variables that store memory addresses. They are used to manipulate memory directly and improve performance.
Pointers are declared using an asterisk (*) before the variable name.
Pointers can be used to dynamically allocate memory using functions like malloc() and free().
Pointers can be used to pass variables by reference to functions.
Tip 1 : Do atleast 1 project
Tip 2 : Practice Data structure programming questions
Tip 3 : Prepare concepts with examples (Coding/Numericals)
Tip 1 : Mention Projects
Tip 2 : Mention only those technologies which you are confident enough.
Tip 3 : Mention extra curricular activities if have.
posted on 12 Apr 2024
I applied via Referral and was interviewed before Apr 2023. There were 4 interview rounds.
Few questions that would involve problem solving. Basic 10th std math would suffice
Had few DSA questions.
posted on 31 Aug 2024
I applied via Naukri.com and was interviewed in Mar 2024. There were 2 interview rounds.
Simple question on maths
OOPS (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPS focuses on creating objects that interact with each other to solve complex problems
Key principles include encapsulation, inheritance, polymorphism, and abstraction
Encapsulation ensures that the internal state of an object is hidden from the outside world
Inheritance allows a class to inherit...
posted on 21 Jul 2023
Program to check if a string is an anagram
Create a function that takes in two strings as input
Remove all spaces and convert both strings to lowercase
Sort both strings and compare if they are equal to determine if they are anagrams
React lifecycle methods are special methods that are automatically called by React at specific points in a component's life cycle.
React components have several lifecycle methods such as componentDidMount, componentDidUpdate, componentWillUnmount, etc.
These methods allow developers to perform actions at specific points in a component's life cycle, such as fetching data, updating the UI, or cleaning up resources.
Understa...
Create a web app to perform cred operation
posted on 6 Jan 2024
I applied via Campus Placement and was interviewed before Jan 2023. There were 4 interview rounds.
General aptitude questions
Abstract topic group discussion
I applied via Campus Placement and was interviewed in Dec 2024. There was 1 interview round.
2 questions of DSA medium to hard
posted on 27 Mar 2024
I applied via Company Website and was interviewed before Mar 2023. There were 3 interview rounds.
Normal aptitude questions
Python basic and some basic coding questions
Advance level coding question
posted on 14 Sep 2021
I appeared for an interview in Jan 2021.
Round duration - 30 minutes
Round difficulty - Medium
It was in the morning around 9:00Am-9:30AM. Platform used for this round was hacerrank. Questions were of moderate to difficult level.
You are given an array of integers ARR
and an integer X
. Your task is to determine the number of subarrays of ARR
whose bitwise XOR is equal to X
.
Count the number of subarrays in an array whose XOR is equal to a given value.
Iterate through the array and keep track of XOR values and their frequencies using a hashmap.
For each element in the array, calculate the XOR value with all previous elements and check if it equals the given XOR value.
Use the concept of XOR to efficiently solve the problem.
Handle edge cases like XOR value being 0 separately.
Time complexity ca...
Given a string STR
, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
STR = ...
Return all possible non-empty subsequences with distinct characters from a given string.
Iterate through all possible subsequences of the input string
Check for distinct characters in each subsequence
Return the distinct character subsequences as an array of strings
Round duration - 15 minutes
Round difficulty - Easy
It was in the night around 8:00PM-8:20PM. Interviewer was very calm in questioning. Platform used for this round was Skype and the questions focused more on personality rather than total.
Tip 1 : Practice aptitude questions a lot.
Tip 2 : Do some projects
Tip 3 : Research about company thoroughly
Tip 1 : It should be in proper format.
Tip 2 : Each skills should be mentioned properly.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
209
salaries
| ₹8 L/yr - ₹25 L/yr |
Senior Software Engineer
125
salaries
| ₹10.7 L/yr - ₹29.5 L/yr |
QA Engineer
72
salaries
| ₹5.2 L/yr - ₹12.4 L/yr |
Software Developer
67
salaries
| ₹8.4 L/yr - ₹18 L/yr |
Softwaretest Engineer
46
salaries
| ₹3.4 L/yr - ₹7.2 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services