Upload Button Icon Add office photos
Engaged Employer

i

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

Apexon Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Apexon RPA Developer Interview Questions and Answers

Updated 27 Sep 2024

Apexon RPA Developer Interview Experiences

1 interview found

RPA Developer Interview Questions & Answers

user image Anonymous

posted on 27 Sep 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Sep 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. What is Bot insights
  • Ans. 

    Bot insights provide analytics and data on the performance and usage of bots in RPA processes.

    • Bot insights offer detailed reports on bot performance metrics such as execution time, error rates, and throughput.

    • They help in identifying bottlenecks, optimizing processes, and improving overall efficiency.

    • Examples of bot insights tools include UiPath Insights and Automation Anywhere Analytics.

  • Answered by AI
  • Q2. What are role of bot creator and bot runner
  • Ans. 

    Bot creator designs and develops the bot, while bot runner executes the bot and monitors its performance.

    • Bot creator designs and develops the bot based on the requirements provided by the organization.

    • Bot runner is responsible for executing the bot on the designated systems and monitoring its performance.

    • Bot creator may need to collaborate with business analysts and stakeholders to understand the process to be automate...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - oTHERS

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    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...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Exam was conducted on programmes. 10 questions were asked

Interview Questionnaire 

1 Question

  • Q1. Interview questions on .net technology

Interview Questionnaire 

1 Question

  • Q1. Focus mainly on Javascript basics and React or Angular.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Nov 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Coding round is related to DSA

Round 2 - Technical 

(2 Questions)

  • Q1. Java related questions
  • Q2. Explain about your project
Round 3 - HR 

(2 Questions)

  • Q1. Salary negotiation
  • Q2. Why you want to join us?

I applied via Company Website and was interviewed in Aug 2021. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Where do you see yourself in 5 years

Interview Preparation Tips

Interview preparation tips for other job seekers - I would say, be confident always
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Apr 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Core java basic questions
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. 1. what is ITSM 2. business rule, client script 3. recent task 4. integration
Round 1 - Technical 

(2 Questions)

  • Q1. Wat is asp.net and how we cater for filter on this application
  • Ans. 

    ASP.NET is a web application framework developed by Microsoft to build dynamic web pages and applications.

    • ASP.NET is used to create web applications and websites

    • It supports multiple programming languages like C#, VB.NET, etc.

    • Filters in ASP.NET are used to intercept and modify HTTP requests and responses

    • Filters can be used for authentication, logging, caching, etc.

  • Answered by AI
  • Q2. Wat is web api and how its related to the mvc application
  • Ans. 

    Web API is a framework for building HTTP services that can be consumed by a variety of clients.

    • Web API is a part of the ASP.NET framework

    • It allows developers to build RESTful services

    • It can be used to create APIs for web applications built using MVC

    • Web API can return data in various formats such as JSON, XML, etc.

    • It supports HTTP verbs such as GET, POST, PUT, DELETE, etc.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - HTC is global company . Its nice to look for new career. I thought its BPO based

Skills evaluated in this interview

Apexon Interview FAQs

How many rounds are there in Apexon RPA Developer interview?
Apexon interview process usually has 1 rounds. The most common rounds in the Apexon interview process are Technical.
How to prepare for Apexon RPA Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Apexon. The most common topics and skills that interviewers at Apexon expect are .Net, Perl, Powershell, Process automation and Python.
What are the top questions asked in Apexon RPA Developer interview?

Some of the top questions asked at the Apexon RPA Developer interview -

  1. What are role of bot creator and bot run...read more
  2. What is Bot insig...read more

Tell us how to improve this page.

Apexon RPA Developer Interview Process

based on 2 interviews

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

CitiusTech Interview Questions
3.4
 • 270 Interviews
Altimetrik Interview Questions
3.8
 • 217 Interviews
Xoriant Interview Questions
4.1
 • 181 Interviews
Globant Interview Questions
3.8
 • 172 Interviews
ThoughtWorks Interview Questions
3.9
 • 147 Interviews
Brillio Interview Questions
3.4
 • 130 Interviews
Luxoft Interview Questions
3.7
 • 123 Interviews
View all
Apexon RPA Developer Salary
based on 24 salaries
₹3 L/yr - ₹7.7 L/yr
At par with the average RPA Developer Salary in India
View more details

Apexon RPA Developer Reviews and Ratings

based on 3 reviews

5.0/5

Rating in categories

4.8

Skill development

5.0

Work-life balance

4.8

Salary

5.0

Job security

5.0

Company culture

4.8

Promotions

4.8

Work satisfaction

Explore 3 Reviews and Ratings
Senior Software Engineer
774 salaries
unlock blur

₹6.2 L/yr - ₹25 L/yr

Software Engineer
595 salaries
unlock blur

₹3.8 L/yr - ₹14.3 L/yr

Softwaretest Engineer
258 salaries
unlock blur

₹2.8 L/yr - ₹10.6 L/yr

Senior Engineer
239 salaries
unlock blur

₹7 L/yr - ₹25.8 L/yr

Technical Lead
191 salaries
unlock blur

₹10.2 L/yr - ₹35 L/yr

Explore more salaries
Compare Apexon with

Xoriant

4.1
Compare

CitiusTech

3.4
Compare

HTC Global Services

3.6
Compare

HERE Technologies

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview