i
Brane
Enterprises
Filter interviews by
A grocery bill system using OOP concepts to manage items, calculate totals, and apply discounts.
Create a class 'Item' to represent each grocery item with attributes like name, price, and quantity.
Implement a class 'Cart' that holds an array of 'Item' objects and methods to add, remove, and list items.
Add a method in 'Cart' to calculate the total bill by iterating through the items and summing their prices.
Include ...
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if needed.
Bubble Sort works by repeatedly iterating through the array.
During each iteration, adjacent elements are compared and swapped if they are in the wrong order.
The process is repeated until no swaps are needed, indicating that the array is sorted.
Example: For the array [5, 3, 8, 4, 2]...
Swap two elements in an array without using a third variable by leveraging arithmetic operations or bitwise XOR.
Use addition and subtraction: a = a + b; b = a - b; a = a - b; Example: a=5, b=3 becomes a=8, b=5, a=5.
Use multiplication and division: a = a * b; b = a / b; a = a / b; Example: a=5, b=3 becomes a=15, b=5, a=3.
Use bitwise XOR: a = a ^ b; b = a ^ b; a = a ^ b; Example: a=5 (101), b=3 (011) becomes a=3, b=...
I have used tools like TensorFlow, IBM Watson, and Google Cloud AI. I stay updated through online courses, conferences, and research papers.
Used TensorFlow for deep learning projects
Utilized IBM Watson for natural language processing tasks
Worked with Google Cloud AI for image recognition applications
Stay updated through online courses, conferences, and research papers
BFS explores nodes layer by layer, ideal for shortest path in unweighted graphs.
BFS uses a queue to track nodes to explore next.
It starts from a source node and explores all neighbors before moving deeper.
Example: In a social network graph, BFS can find the shortest connection path between two users.
BFS is optimal for finding the shortest path in unweighted graphs.
It can be implemented using an adjacency list or m...
A priority queue is a data structure where each element has a priority, and elements are served based on their priority.
Elements with higher priority are dequeued before those with lower priority.
Common implementations include binary heaps, Fibonacci heaps, and unordered lists.
Example: In a hospital, patients with critical conditions are treated before those with minor issues.
Priority queues are used in algorithms...
Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
DFS uses a stack data structure, either explicitly or via recursion.
It can be used to find connected components in a graph.
Example: In a maze, DFS can help find a path from start to finish.
DFS can be implemented using an adjacency list or matrix.
It is useful for topological sorting in dire...
I prepare by reviewing project scope, identifying key stakeholders, setting objectives, and creating a list of questions.
Review project scope to understand the goals and requirements
Identify key stakeholders to involve in the session
Set clear objectives for the session to ensure focus
Create a list of questions to guide the discussion and gather necessary information
Find the length of the longest increasing subsequence in an array.
Use dynamic programming to keep track of the longest increasing subsequence ending at each index.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence ending at each index based on previous values.
Return the maximum valu...
Business processes are a set of activities that organizations perform to achieve their goals.
Sales process - involves identifying potential customers, qualifying them, and closing deals
Supply chain process - involves the flow of goods and services from suppliers to customers
Human resources process - involves recruiting, hiring, training, and managing employees
Financial process - involves managing financial transac...
Merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged result.
Compare the values of the nodes from both input lists and add the smaller value to the result list.
Move the pointer of the list with the smaller value to the next node and continue until both input lists are empty.
Find the length of the longest increasing subsequence in an array.
Use dynamic programming to keep track of the longest increasing subsequence ending at each index.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence ending at each index based on previous values.
Return the maximum value in ...
Some critical thinking and then project queries
I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.
I have a strong technical knowledge in software development, database management, and system architecture.
Proficient in programming languages such as Java, Python, and SQL
Experience with database management systems like MySQL and MongoDB
Knowledge of system architecture and design principles
Familiarity with cloud computing platforms like AWS and Azure
I have used tools like TensorFlow, IBM Watson, and Google Cloud AI. I stay updated through online courses, conferences, and research papers.
Used TensorFlow for deep learning projects
Utilized IBM Watson for natural language processing tasks
Worked with Google Cloud AI for image recognition applications
Stay updated through online courses, conferences, and research papers
Prodman is a comprehensive product management tool that helps streamline product development processes.
Prodman is a software solution designed to assist product managers in organizing and managing product development tasks.
It offers features such as task tracking, collaboration tools, and analytics to improve efficiency and decision-making.
Prodman helps teams prioritize tasks, set deadlines, and communicate effectively...
I prepare by reviewing project scope, identifying key stakeholders, setting objectives, and creating a list of questions.
Review project scope to understand the goals and requirements
Identify key stakeholders to involve in the session
Set clear objectives for the session to ensure focus
Create a list of questions to guide the discussion and gather necessary information
I am a dedicated and experienced professional with a strong background in solution design and implementation.
Over 5 years of experience in solution architecture and project management
Skilled in leading cross-functional teams to deliver successful solutions
Strong analytical and problem-solving skills
Excellent communication and presentation abilities
Previously led a team in implementing a CRM solution for a Fortune 500 c...
I applied via Campus Placement and was interviewed before Aug 2023. There were 3 interview rounds.
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if needed.
Bubble Sort works by repeatedly iterating through the array.
During each iteration, adjacent elements are compared and swapped if they are in the wrong order.
The process is repeated until no swaps are needed, indicating that the array is sorted.
Example: For the array [5, 3, 8, 4, 2], the...
Swap two elements in an array without using a third variable by leveraging arithmetic operations or bitwise XOR.
Use addition and subtraction: a = a + b; b = a - b; a = a - b; Example: a=5, b=3 becomes a=8, b=5, a=5.
Use multiplication and division: a = a * b; b = a / b; a = a / b; Example: a=5, b=3 becomes a=15, b=5, a=3.
Use bitwise XOR: a = a ^ b; b = a ^ b; a = a ^ b; Example: a=5 (101), b=3 (011) becomes a=3, b=5.
A grocery bill system using OOP concepts to manage items, calculate totals, and apply discounts.
Create a class 'Item' to represent each grocery item with attributes like name, price, and quantity.
Implement a class 'Cart' that holds an array of 'Item' objects and methods to add, remove, and list items.
Add a method in 'Cart' to calculate the total bill by iterating through the items and summing their prices.
Include a met...
I applied via Referral and was interviewed before Sep 2023. There was 1 interview round.
Top trending discussions
The duration of Brane Enterprises Associate Solution Lead interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 25 interview experiences
Difficulty level
Duration
based on 139 reviews
Rating in categories
Associate Solution Lead
543
salaries
| ₹10.7 L/yr - ₹19 L/yr |
Solution Lead
263
salaries
| ₹22 L/yr - ₹37 L/yr |
Product Manager
195
salaries
| ₹17 L/yr - ₹29.6 L/yr |
Associate Product Manager
106
salaries
| ₹6.2 L/yr - ₹24 L/yr |
Business Analyst
104
salaries
| ₹5.5 L/yr - ₹12 L/yr |
Duck Creek Technologies
3Pillar Global
Acies
Winman Software