i
Ginesys
Filter interviews by
Group Discussion which was simple all were selected
Top trending discussions
I applied via Company Website and was interviewed in Oct 2023. There were 2 interview rounds.
posted on 29 Nov 2022
I applied via Referral and was interviewed before Nov 2021. There were 4 interview rounds.
My 5-year goal is to become a senior business development executive, leveraging my skills and experience to drive growth and success for the company.
To become a senior business development executive
To leverage my skills and experience
To drive growth and success for the company
posted on 6 Jan 2024
I applied via Naukri.com and was interviewed in Dec 2023. There were 3 interview rounds.
Is an exam Used to determined individual skills or propensity to succeed in a given activities
posted on 17 Jul 2023
I applied via Campus Placement and was interviewed before Jul 2022. There were 4 interview rounds.
Medium level coding questions were asked
Breadth First Search is a graph traversal algorithm that explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
Start by visiting the root node and then visit all the neighbor nodes at the present depth level before moving on to the nodes at the next depth level.
Use a queue data structure to keep track of the nodes to be visited.
Mark each node as visited to avoid re...
Depth First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
Start at a node and explore as far as possible along each branch before backtracking
Use a stack to keep track of nodes to visit
Mark visited nodes to avoid revisiting them
Can be implemented recursively or iteratively
Inorder traversal of a binary tree involves visiting the left subtree, then the root, and finally the right subtree.
Start at the root node
Recursively traverse the left subtree
Visit the current node
Recursively traverse the right subtree
Repeat until all nodes are visited
Swap alternative nodes of a linked list
Iterate through the linked list and swap the data of alternate nodes
Use temporary variables to store data during swapping
Ensure to handle cases where the linked list has an odd number of nodes
Reverse a linked list by changing the next pointers of each node
Start with three pointers: current, prev, and next
Iterate through the linked list, updating the next pointer of each node to point to the previous node
Update prev, current, and next pointers for each iteration
Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
posted on 29 Nov 2022
I applied via Referral and was interviewed before Nov 2021. There were 4 interview rounds.
My 5-year goal is to become a senior business development executive, leveraging my skills and experience to drive growth and success for the company.
To become a senior business development executive
To leverage my skills and experience
To drive growth and success for the company
posted on 20 Feb 2023
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Jan 2023. There were 4 interview rounds.
Aptitude questions is average.
Some aptitude questions have to appear as a online test
Gd will be taken on any topics
I applied via Company Website and was interviewed in Oct 2023. There were 2 interview rounds.
posted on 12 Jun 2022
I applied via Company Website and was interviewed in May 2022. There were 2 interview rounds.
based on 1 review
Rating in categories
Business Analyst
25
salaries
| ₹2.4 L/yr - ₹9.7 L/yr |
Business Development Manager
22
salaries
| ₹3.1 L/yr - ₹9 L/yr |
Functional Consultant
22
salaries
| ₹3.6 L/yr - ₹7 L/yr |
Functional Associate
12
salaries
| ₹3.6 L/yr - ₹5.8 L/yr |
Executive Accountant
11
salaries
| ₹3.2 L/yr - ₹4.5 L/yr |
MARG ERP
LOGIC ERP
CBO Infotech
GoFrugal Technologies