i
Busy Infotech
Filter interviews by
OOPS stands for Object-Oriented Programming System. It is a programming paradigm based on the concept of objects.
OOPS focuses on creating objects that contain data and methods to manipulate that data.
Encapsulation is the concept of bundling data and methods that operate on the data within a single unit, called an object.
Inheritance allows one class to inherit properties and behavior from another class.
Polymorphism allo...
Top trending discussions
I applied via Naukri.com and was interviewed in Mar 2021. There were 3 interview rounds.
Developed a web application for managing customer orders and inventory
Used Java and Spring framework for backend development
Implemented a responsive user interface using HTML, CSS, and JavaScript
Integrated with a relational database for data storage and retrieval
Implemented authentication and authorization features for secure access
Performed unit testing and bug fixing throughout the development process
Reverse Linked List
Pallindrome of String
Flyover building in team with strength
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Easy
The test had it's webcam on, we were not allowed to go out of the frame.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
The program calculates the Nth Fibonacci number using a recursive formula.
The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.
The program uses a recursive function to calculate the Nth Fibonacci number.
The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.
You are provided with an unsorted array/list ARR
of N
integers. Your task is to determine the length of the longest consecutive sequence present in the array...
The task is to find the length of the longest consecutive sequence in an unsorted array of integers.
Sort the array to bring consecutive numbers together
Iterate through the sorted array and keep track of the current consecutive sequence length
Update the maximum length if a longer sequence is found
Round duration - 30 minutes
Round difficulty - Medium
The interview was online from home.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.
Iterate through the string from the last character to the first character and append each character to a new string.
Alternatively, you can use built-in string reversal functions or methods available in your programming language.
To solve the follow-up question with O(1) space complexity, you can use a tw...
Round duration - 20 minutes
Round difficulty - Easy
This was last round. In this round interviewer ask about me and what i know about company. Also he ask about my projects as well as my future goals .
The interviewer was very understanding and supportive.
Tip 1 : Find a good course, and first clear all your fundamentals and implementation of every data structure. You should be thorough with their time as well as space complexities.
Tip 2 : Upon clearing the fundamentals, select a platform where you have a large no of questions, also whose test cases are good. eg. LeetCode, InterviewBit or Codezen. Go and complete 300-400 questions.
Tip 3 : Also whenever you're not able to solve the problem, check out the editorial and then re-attempt it again. Also, check the discussion if there is some good solution to the same problem.
Tip 4 : For OOPS, DS and programming, I recommend Codezen, Leetcode, InterviewBit and GeeksforGeeks.
Tip 5 : For OS, DBMS and Computer Network, I recommend GateSmasher, Knowledge Gate and TutorialsPoint.
Tip 1 : Resume should contain facts, numbers, and data comparison.
Tip 2 : Mention only those projects and internships in your resume that you are comfortable with, that is, you can explain to the interviewee.
Tip 3 : Technical achievements in the field you're applying to, would be good.
Tip 4 : DO NOT FAKE THINGS, the interviewer is smart enough.
I applied via Campus Placement and was interviewed in Apr 2022. There were 3 interview rounds.
Aptitude test was there in exam
Coding 3 questions were there in exam
posted on 25 Sep 2024
I applied via Company Website and was interviewed before Sep 2023. There were 3 interview rounds.
As usual interview with an aptitude test
I applied via Naukri.com and was interviewed before Sep 2021. There were 6 interview rounds.
1 hr time limit. Some technical mathematical question, english grammar related, genral knowledge.
After clearing apti, they will assign machine test. 1 hr time limite.
I applied via Approached by Company and was interviewed in Dec 2022. There were 5 interview rounds.
Don’t panic. All rounds are easy
I appeared for an interview in May 2022.
Round duration - 120 Minutes
Round difficulty - Easy
Given a list of rectangles, where each rectangle is represented by an array of four integers indicating its bottom-left and top-right corners, calculate the total area covered b...
Calculate total area covered by a list of rectangles on a plane.
Iterate through each rectangle and calculate its area
Check for overlapping areas between rectangles
Sum up the total area covered by all rectangles
Round duration - 60 Minutes
Round difficulty - Medium
Oops concepts and 1 DSA problem
You are provided with a string, termed as DIGIT_PATTERN
, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no...
Identify the first repeating digit in a given string of digits.
Iterate through the string and keep track of seen digits using a set.
Return the first digit that repeats, or -1 if no digit repeats.
Time complexity: O(n), where n is the length of the input string.
Round duration - 60 Minutes
Round difficulty - Medium
Firstly Some general questions and then suddenly a cosing question with modifications
Given an input string STR
, generate and print all possible permutations of the string.
str
All permutations of the input string, each on a new line.
Generate and print all possible permutations of a given input string.
Use recursion to generate all permutations by swapping characters in the string.
Maintain a visited array to keep track of characters already used in a particular permutation.
Print each permutation as it is generated.
Handle duplicate characters by skipping swapping if the character is already in the current position.
Tip 1 : You should be perfect in what you know
Tip 2 : Prepare atleast DSA standard questions very well
Tip 3 : Don't ignore OOPs, they are asked very frequently.
Tip 1 : Add good projects
Tip 2 : Must mention all your coding profiles and github where you worked.
based on 1 interview
Interview experience
Assistant Manager
45
salaries
| ₹3.1 L/yr - ₹8.5 L/yr |
Area Sales Manager
41
salaries
| ₹3.5 L/yr - ₹8.9 L/yr |
Technical Support Executive
28
salaries
| ₹2 L/yr - ₹3.7 L/yr |
Assistant Sales Manager
27
salaries
| ₹4 L/yr - ₹9 L/yr |
Software Developer
19
salaries
| ₹3 L/yr - ₹8 L/yr |
Ascent HR Technologies Private Limited
Vyapar
Entrata
CodeClouds