Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Apar Industries Team. If you also belong to the team, you can get access from here

Apar Industries Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Apar Industries Web Developer Interview Questions and Answers

Updated 15 Jul 2024

Apar Industries Web Developer Interview Experiences

1 interview found

Web Developer Interview Questions & Answers

user image Anonymous

posted on 15 Jul 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Tell me something about yourself

Top trending discussions

View All
Interview Tips & Stories
6d (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Apar Industries?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(3 Questions)

Round duration - 30 minutes
Round difficulty - Easy

  • Q1. How do you search for a node in a linked list?
  • Ans. 

    To search for a node in a linked list, iterate through the list and compare each node's value with the target value.

    • Start at the head of the linked list

    • Iterate through each node by following the 'next' pointer

    • Compare the value of each node with the target value

    • Return the node if found, otherwise return null

  • Answered by AI
  • Q2. How do you detect a loop in a linked list?
  • Ans. 

    To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.

    • Initialize two pointers, slow and fast, at the head of the linked list.

    • Move slow pointer by one step and fast pointer by two steps.

    • If there is a loop, the two pointers will eventually meet.

    • Alternatively, we can use a hash set to store visited nodes and check for duplicates.

  • Answered by AI
  • Q3. Implement a stack using a singly linked list.
  • Ans. 

    Implement a stack using a singly linked list

    • Create a Node class with data and next pointer

    • Create a Stack class with top pointer pointing to the top of the stack

    • Implement push, pop, and peek operations by manipulating the linked list

    • Example: Node class - Node { int data; Node next; }

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Easy

  • Q1. What is the top view of a binary tree?
  • Ans. 

    The top view of a binary tree shows the nodes visible from the top when looking down from the root node.

    • The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.

    • Nodes at the same horizontal distance from the root are considered at the same level in the top view.

    • If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...

  • Answered by AI
  • Q2. Explain the process of deleting a node from a linked list, covering all possible cases.
  • Ans. 

    Deleting a node from a linked list involves updating pointers to maintain the list's integrity.

    • Identify the node to be deleted by traversing the list

    • Update the previous node's next pointer to skip the node to be deleted

    • Free the memory allocated to the node to be deleted

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Inderprastha Engineering College. I applied for the job as SDE - 1 in NoidaEligibility criteriaminimum 70 %Cadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Object-Oriented Programming, System DesignTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand. 

Application resume tips for other job seekers

Keep your resume short and up to mark and check spellings before submitting it for the interview process.

Final outcome of the interviewSelected

Skills evaluated in this interview

Web Developer Interview Questions Asked at Other Companies

Q1. Last Index of Element The task is to determine the index of the l ... read more
Q2. Check Indices With Given Difference Problem Statement You are pro ... read more
asked in Evalueserve
Q3. Reverse Linked List Problem Statement Given a singly linked list ... read more
asked in Internshala
Q4. Clone a Linked List with Random Pointers Given a linked list wher ... read more
asked in Internshala
Q5. Loot Houses Problem Statement A thief is planning to steal from s ... read more

Interview Questionnaire 

9 Questions

  • Q1. Tree questions related like traversal?
  • Q2. Locate the sum of 2 numbers in a linear array (Unsorted and sorted) and their complexities
  • Ans. 

    Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities

    • For unsorted array, use nested loops to compare each element with every other element until the sum is found

    • For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found

    • Complexity for unsorted array is O(n^2) and for sorted array is O(n)

  • Answered by AI
  • Q3. Pointers with increment/decrement, address of and value at operators (++,–,*,&)
  • Ans. 

    Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.

    • Incrementing a pointer moves it to the next memory location of the same data type

    • Decrementing a pointer moves it to the previous memory location of the same data type

    • The address of operator (&) returns the memory address of a variable

    • The value at operator (*) returns the value sto...

  • Answered by AI
  • Q4. A point and a rectangle is present with the given coordinates. How will you determine whether the point is inside or outside the rectangle?
  • Ans. 

    To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.

    • Check if the point's x-coordinate is greater than the left edge of the rectangle

    • Check if the point's x-coordinate is less than the right edge of the rectangle

    • Check if the point's y-coordinate is greater than the top edge of the rectangle

    • Check if the point's y-coordinate is less than the b...

  • Answered by AI
  • Q5. There is a point inside the rectangle. How will you determine the line that passes through the point and divides the rectangle into 2 equal halves?
  • Ans. 

    To find line that divides rectangle into 2 equal halves through a point inside it.

    • Find the center of the rectangle

    • Draw a line from the center to the given point

    • Extend the line to the opposite side of the rectangle

    • The extended line will divide the rectangle into 2 equal halves

  • Answered by AI
  • Q6. There is a scheme which contains 8-bit and 16-bit signed numbers. How many such combinations are possible?
  • Ans. 

    There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?

    • There are 2^8 (256) possible combinations of 8-bit signed numbers.

    • There are 2^16 (65,536) possible combinations of 16-bit signed numbers.

    • To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.

    • Therefore, the total number of possible combinations is 256 + ...

  • Answered by AI
  • Q7. You are given an array of elements. Some/all of them are duplicates. Find them in 0(n) time and 0(1) space. Property of inputs – Number are in the range of 1..n where n is the limit of the array
  • Ans. 

    Find duplicates in an array of elements in 0(n) time and 0(1) space.

    • Use the property of inputs to your advantage

    • Iterate through the array and mark elements as negative

    • If an element is already negative, it is a duplicate

    • Return all the negative elements as duplicates

  • Answered by AI
  • Q8. Given a array of digits. print all combination of of these i.e all no formed by these. repetition allowed. and then repetition not allowed example: i/p: arr={1,2,3} o/p: (without repetition) 123, 132, 213,...
  • Ans. 

    Generate all combinations of digits from an array, allowing and disallowing repetition.

    • Use recursion or backtracking to generate combinations.

    • For repetition allowed: e.g., arr={1,2}, combinations are 11, 12, 21, 22.

    • For repetition not allowed: e.g., arr={1,2,3}, combinations are 123, 132, 213, 231, 312, 321.

    • Utilize a set to track used digits when repetition is not allowed.

  • Answered by AI
  • Q9. Questions on project

Interview Preparation Tips

Round: Test
Duration: 90 minutes
Total Questions: 3

Round: HR Interview
Experience: HR interview was all about my projects, my background and a few more typical HR questions. It was pretty easy to answer them.

Skills: Algorithm, Data structure, C++
College Name: IIT ROORKEE

Skills evaluated in this interview

I appeared for an interview in Sep 2016.

Interview Preparation Tips

Round: Test
Experience: Questions aren't tough but they take more time to read itself.
Tips: First try to attempt the questions which are seemingly small. Reading bigger questions first and wasting more time on that isnt a good idea at all.
Duration: 30 minutes
Total Questions: 30

Skills: Technical Skill, Analytical Skills
College Name: IIT Kharagpur

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. What is a program, task and threads
  • Ans. 

    A program is a set of instructions that tells a computer what to do. A task is a unit of work performed by a program. A thread is a sequence of instructions within a task.

    • A program is a collection of instructions that are executed by a computer to perform a specific task.

    • A task is a unit of work that is performed by a program. It can be a specific action or a set of actions.

    • A thread is a sequence of instructions within...

  • Answered by AI
  • Q2. Delete a node in a linked list
  • Ans. 

    To delete a node in a linked list, we need to adjust the pointers of the previous and next nodes.

    • Find the node to be deleted by traversing the linked list

    • Adjust the pointers of the previous and next nodes to skip the node to be deleted

    • Free the memory occupied by the node to be deleted

  • Answered by AI
  • Q3. What is a function pointer and volatile type in c
  • Ans. 

    A function pointer is a variable that stores the address of a function. Volatile type is used to declare variables that can be modified by external factors.

    • Function pointers are used to pass functions as arguments to other functions.

    • Volatile type is used when a variable's value can be changed unexpectedly by external factors.

    • Function pointers can be used to implement callbacks or event handling mechanisms.

    • Volatile type...

  • Answered by AI
  • Q4. Summarise your resume
  • Ans. 

    Experienced software developer with expertise in Java, Python, and SQL

    • Proficient in Java, Python, and SQL programming languages

    • Developed web applications using Java Spring framework

    • Experience with database management and optimization using SQL

    • Worked on various software projects in a team environment

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Paper was challenging and It was well set.

Duration: 90 minutes
Total Questions: 60

Round: Technical Interview
Experience: It was a very good experience overall. Interviewer helped to ease the tension.
Tips: Waiting time can be reduced.

General Tips: Prepare for precedence of operators in C.
Try to be fast in solving the problems.
Skills: Knowledge Of Your Resume Points, Pointers In C, Operating System Basics
Duration: 2
College Name: IIT Madras
Motivation: Qualcomm is a

Skills evaluated in this interview

Interview Questionnaire 

5 Questions

  • Q1. In C programming they asked about storage classes, Volatile , Whole compilation process steps by steps, Dangling pointer , Memory leak, Memory corruption
  • Q2. In data structure they asked question on String , Linked List and array
  • Q3. Data structure question section is easy don't go for complex algorithms just study basic algorithms. like reverse the linked list in group on given size
  • Q4. They also asked question on bit manipulation. Like Check that given number binary representation is palindrome or not?
  • Q5. Swap even and odd bits in given number
  • Ans. 

    Swap even and odd bits in a given number

    • Create a mask for even bits and odd bits

    • Shift even bits to right and odd bits to left

    • Combine even and odd bits using bitwise OR operator

  • Answered by AI

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

I applied via Referral and was interviewed before Dec 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Signal and power integrity question
  • Ans. Refer book by Eric bogatin
  • Answered by Saahil Naik

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn about package design also
Are these interview questions helpful?

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.

  • Q1. 

    Count Set Bits Problem Statement

    Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...

  • Ans. 

    Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.

    • Use bitwise operations to count the set bits in each number from 1 to N.

    • Keep track of the total set bits and return the result modulo 1e9+7.

    • Optimize the solution to handle large values of N efficiently.

    • Consider using dynamic programming or precomputing values for faster computation.

  • Answered by AI
Round 2 - Video Call 

Round duration - 30 mins
Round difficulty - Easy

This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8CGPAMicron Technology interview preparation:Topics to prepare for the interview - Apptitude, C, Java, Data Structures and Algorithms, DBMSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Do participate in all the coding contests, long challenges held by codechef, codeforces
Tip 2 : Practice all kinds of problems on leetcode, gfg, coding ninjas
Tip 3 : When you are writing a written exam for a particular company, make sure you get to know about the company in detail.

Application resume tips for other job seekers

Tip 1 : Make your resume short and sweet(mostly 1 page, max 2 pages) is preferred.
Tip 2 : Make sure your resume is crisp rather than descriptive
Tip 3 : Do not lie on your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Oct 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:00 PM.

  • Q1. 

    Merge Overlapping Intervals Problem Statement

    Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...

  • Ans. 

    Merge overlapping intervals and return sorted list of merged intervals.

    • Iterate through intervals and merge overlapping ones

    • Sort merged intervals based on starting times

    • Handle edge cases like empty input or single interval

    • Use a data structure like list or array to store merged intervals

  • Answered by AI
  • Q2. 

    Search In Rotated Sorted Array Problem Statement

    Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

    Note:
    1. If 'K' is not present...
  • Ans. 

    Given a rotated sorted array, find the index of a given integer 'K'.

    • Use binary search to find the pivot point where the array is rotated.

    • Based on the pivot point, perform binary search on the appropriate half of the array to find 'K'.

    • Handle cases where 'K' is not present in the array by returning -1.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was an Online F2F Technical Round conducted on CodePair : Hackerearth. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Hackerearth & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 11:00 A.M to 12:00 P.M

  • Q1. 

    Minimum Fountains Activation Problem

    In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...

  • Ans. 

    Find the minimum number of fountains to activate to water the entire garden.

    • Iterate through the array to find the coverage of each fountain.

    • Keep track of the farthest coverage reached by activating fountains.

    • Activate the fountain that covers the farthest point not yet covered.

    • Repeat until the entire garden is watered.

  • Answered by AI
  • Q2. 

    Bellman Ford Shortest Path Problem

    Given a directed weighted graph comprised of vertices labeled 1 to N and M edges, where each edge connects two nodes u and v with a weight w representing the distance be...

  • Ans. 

    Bellman Ford algorithm is used to find the shortest path in a graph with negative weights.

    • Initialize distances from source to all vertices as infinity, and distance to source as 0.

    • Relax all edges V-1 times to find shortest path.

    • If any distance is updated in Vth iteration, then there is a negative weight cycle.

    • Return the distance to destination vertex after V-1 iterations.

    • Example: For the given graph, shortest path from...

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a Google Meet Video Call. The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteriaNo backlogs in MastersQualcomm interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Computer Networks, Computer System Architecture, Operating System, Data Structures, PointersTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.

Application resume tips for other job seekers

Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(5 Questions)

  • Q1. What is oops concept example with each one
  • Ans. 

    Object-oriented programming concepts include encapsulation, inheritance, polymorphism, and abstraction.

    • Encapsulation: bundling data and methods that operate on the data into a single unit (class). Example: class Car with properties like make, model, and methods like start(), stop().

    • Inheritance: creating new classes based on existing classes, inheriting their attributes and methods. Example: class SUV inheriting from cl...

  • Answered by AI
  • Q2. What is data structures and types with examples of all types
  • Ans. 

    Data structures are ways of organizing and storing data in a computer so that it can be accessed and used efficiently.

    • Types of data structures include arrays, linked lists, stacks, queues, trees, graphs, and hash tables.

    • Arrays are a collection of elements stored in contiguous memory locations, accessed using an index.

    • Linked lists are a series of nodes where each node contains data and a reference to the next node.

    • Stack...

  • Answered by AI
  • Q3. What is class and objects with example and code
  • Ans. 

    A class is a blueprint for creating objects in object-oriented programming. Objects are instances of classes.

    • A class defines the properties and behaviors of objects. For example, a 'Car' class may have properties like 'color' and 'model', and behaviors like 'drive' and 'stop'.

    • An object is an instance of a class. For example, 'myCar' can be an object of the 'Car' class with specific values for 'color' and 'model'.

    • Code e...

  • Answered by AI
  • Q4. What is virutal function and staic functions
  • Ans. 

    Virtual functions are functions in a base class that are overridden in derived classes, while static functions belong to the class itself rather than instances.

    • Virtual functions allow for dynamic binding and polymorphism in object-oriented programming.

    • Static functions are associated with the class itself and can be called without creating an instance of the class.

    • Example: virtual void display() = 0; // pure virtual fun...

  • Answered by AI
  • Q5. What is project u did in present company
  • Ans. 

    Developed a web-based project management tool for tracking tasks and deadlines.

    • Used AngularJS for front-end development

    • Implemented RESTful APIs for communication between front-end and back-end

    • Utilized MySQL database for storing project data

  • Answered by AI
Round 2 - Coding Test 

Write a function over loading and friend class with example?

Interview Preparation Tips

Interview preparation tips for other job seekers - nice

Skills evaluated in this interview

Apar Industries Interview FAQs

How many rounds are there in Apar Industries Web Developer interview?
Apar Industries interview process usually has 1 rounds. The most common rounds in the Apar Industries interview process are One-on-one Round.

Tell us how to improve this page.

Overall Interview Experience Rating

5/5

based on 1 interview experience

Interview Questions from Similar Companies

Qualcomm Interview Questions
3.8
 • 271 Interviews
Texas Instruments Interview Questions
3.9
 • 126 Interviews
Synopsys Interview Questions
3.9
 • 95 Interviews
Molex Interview Questions
3.9
 • 58 Interviews
Tessolve Interview Questions
3.5
 • 56 Interviews
View all

Apar Industries Web Developer Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Assistant Manager
218 salaries
unlock blur

₹5.9 L/yr - ₹12.5 L/yr

Deputy Manager
96 salaries
unlock blur

₹8.5 L/yr - ₹14.1 L/yr

Officer
66 salaries
unlock blur

₹2.4 L/yr - ₹6 L/yr

Senior Officer
62 salaries
unlock blur

₹3.6 L/yr - ₹8.2 L/yr

Senior Engineer
52 salaries
unlock blur

₹4.2 L/yr - ₹8 L/yr

Explore more salaries
Compare Apar Industries with

Qualcomm

3.8
Compare

Molex

3.9
Compare

TDK India Private Limited

3.8
Compare

Applied Materials

3.8
Compare
write
Share an Interview