i
Element5
Filter interviews by
I applied via Naukri.com and was interviewed in Sep 2023. There were 3 interview rounds.
A storage bucket in Orchestrator is a container used to store files and data related to automation processes.
Storage buckets can be used to store input files, output files, logs, and other data needed for automation processes.
They help in organizing and managing data efficiently within Orchestrator.
Examples of storage buckets include 'InputFiles', 'OutputFiles', 'Logs', etc.
Multibot Architecture is a framework where multiple bots work together to achieve a common goal in Robotic Process Automation (RPA).
Multibot Architecture involves multiple bots collaborating to automate complex processes.
Each bot in the architecture is responsible for a specific task or sub-process.
The bots communicate with each other to share information and coordinate their actions.
This architecture allows for scalab...
To solve stability issues in web automation, ensure robust error handling, optimize element locators, use wait commands, and run tests on stable environments.
Implement robust error handling to gracefully handle unexpected errors and exceptions.
Optimize element locators to ensure reliable identification of web elements.
Use wait commands to ensure that elements are fully loaded before interacting with them.
Run tests on s...
Pdf Automation is the process of using software robots to automate the extraction, processing, and manipulation of data from PDF documents.
Pdf Automation involves using RPA tools to extract text, images, and other data from PDF files.
It can also involve converting PDF files into other formats, such as Excel or Word.
Pdf Automation can streamline document processing tasks and improve efficiency in various industries.
Exam...
I applied via Referral and was interviewed in Jul 2022. There were 4 interview rounds.
I have worked on multiple RPA projects, automating various business processes.
Automated data entry process for a financial institution, reducing errors by 90%
Developed a bot to extract and analyze customer feedback from online surveys
Implemented RPA solution to automate invoice processing, saving 50% of manual effort
I applied via Newspaper Ad and was interviewed before Jun 2022. There were 4 interview rounds.
General Aptitude (Grammmar + Math)
Problem solving (way of approaching the problem)
Developed a chatbot for college library to assist students in finding books and resources.
Researched natural language processing techniques for chatbot functionality
Implemented chatbot using Python and Rasa framework
Integrated chatbot with library database for real-time book availability information
Top trending discussions
Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
Use binary search to find the partition point in both arrays
Calculate the median based on the partition point and array sizes
Adjust the partition points based on the median value
Repeat until the partition points are at the median
Handle edge cases such as empty arrays and uneven array sizes
Anagram of strings in O(1) space complexity
Use a fixed size array of integers to store the frequency of characters in the first string
Iterate through the second string and decrement the frequency of each character in the array
If all the frequencies are zero, then the strings are anagrams
Return true or false accordingly
Level order traversal of a tree using Queue
Create a queue and add the root node to it
While the queue is not empty, remove the front node and print its value
Add the left and right child nodes of the removed node to the queue
Repeat until the queue is empty
Reverse level order traversal of a tree using Queue
Create a queue and push the root node into it
While the queue is not empty, pop the front node and push its children into the queue
Add the popped node to a stack
Once the queue is empty, pop elements from the stack and print them
BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.
BFS uses a queue while DFS uses a stack or recursion.
BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.
BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.
BFS can be used to find connected components while DFS
Find product of each element of an array except that element in O(N) time complexity without using / operation
Use prefix and suffix products
Multiply prefix and suffix products for each element to get the final product
Handle edge cases where array has 0 or 1 element separately
Recursively delete a linked list
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null, return
Recursively call the function with the next node as input
Delete the current node
Recursively delete a linked list from the end.
Start from the head and recursively traverse to the end of the list.
Delete the last node and set the second last node's next pointer to null.
Repeat until the entire list is deleted.
Use a recursive function to implement the deletion process.
Recursively delete a tree by deleting all its child nodes and then the parent node.
Start from the leaf nodes and delete them first.
Then move up to the parent nodes and delete them.
Repeat until the root node is deleted.
Use post-order traversal to ensure child nodes are deleted before parent nodes.
Recursively delete elements from the end of an array.
Create a recursive function that removes the last element of the array.
Call the function recursively until the desired number of elements are removed.
Handle edge cases such as empty arrays and removing more elements than the array contains.
Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.
Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.
Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).
Floyd Warshall can handle negative edge weights while Djikstra cannot.
Floyd Warshall can detect negative cycles while Dj
There is no known algorithm to find shortest path in 2-D space in O(log N) time.
The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).
Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).
If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).
Design a system for putting newspapers using classes and functions
Create a Newspaper class with attributes like title, date, and content
Create a Publisher class with methods to publish and distribute newspapers
Create a Subscriber class with methods to subscribe and receive newspapers
Use inheritance to create different types of newspapers like daily, weekly, etc.
Implement a database to store newspaper information and ha
I believe practical experience is more valuable than higher studies.
I have gained valuable experience through internships and projects.
I prefer hands-on learning and problem-solving over theoretical knowledge.
I am constantly learning and improving my skills through online courses and workshops.
I applied via Naukri.com
A program to find a palindrome word in a 2D matrix of strings.
Iterate through each row and column of the matrix
Check if each string is a palindrome using two pointers approach
Return the first palindrome word found
Design a traffic signal system
Identify the number of lanes and intersections
Determine the traffic flow and peak hours
Choose appropriate sensors and controllers
Implement a synchronization algorithm
Consider emergency vehicle prioritization
Include pedestrian crossing signals
Ensure compliance with local regulations
Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.
Hashmap uses hashing function to map keys to indices in an array
Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing
Java implementation: HashMap
Printing patterns using code
Identify the pattern to be printed
Use loops to print the pattern
Adjust the loop variables to control the pattern
Use conditional statements to modify the pattern
Examples: printing stars, triangles, squares, etc.
Common point in linked list refers to the node where two or more linked lists intersect.
The common point can be found by traversing both linked lists and comparing the nodes.
The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.
Examples include finding the intersection point of two linked lists or finding the loop in a linked list.
I applied via Company Website and was interviewed in Nov 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in Nov 2024. There were 2 interview rounds.
DESIGN 40 MINS HACKERRANK
DESIGN 40 MINS HACCKERANK
I applied via Naukri.com and was interviewed before Oct 2022. There were 3 interview rounds.
Ds questions related to hashing
based on 2 interviews
1 Interview rounds
Senior Software Engineer
7
salaries
| ₹13 L/yr - ₹16 L/yr |
Senior Business Analyst
6
salaries
| ₹11.5 L/yr - ₹18 L/yr |
RPA Developer
6
salaries
| ₹2 L/yr - ₹4.4 L/yr |
Rpa Engineer
5
salaries
| ₹4 L/yr - ₹7.5 L/yr |
Software Engineer
4
salaries
| ₹8.9 L/yr - ₹9.9 L/yr |
Adobe
Autodesk
McAfee
Gen