Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Apr 2022. There was 1 interview round.
Procure to pay cycle is the process of acquiring goods or services from a vendor and paying for them.
The cycle starts with identifying the need for goods or services.
A purchase requisition is created and sent for approval.
Once approved, a purchase order is created and sent to the vendor.
Goods or services are received and inspected.
An invoice is received from the vendor.
The invoice is matched with the purchase order and...
Top trending discussions
I applied via Naukri.com and was interviewed before Feb 2022. There were 3 interview rounds.
I applied via Company Website and was interviewed before Jul 2021. There were 3 interview rounds.
Data validation in Hive involves using built-in functions and custom scripts to ensure data accuracy and consistency.
Use built-in functions like IS NULL, IS NOT NULL, and COALESCE to check for missing or null values
Use regular expressions and pattern matching to validate data formats
Write custom scripts to perform more complex data validation tasks
Perform data profiling to identify potential data quality issues
Use data...
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Medium
Round duration - 20 minutes
Round difficulty - Medium
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Given an array and a target sum, find pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list. Otherwise, add the current element to the hash set.
Sort the pairs based on the first element and then the second element to meet the required output form
Round duration - 20 minutes
Round difficulty - Easy
Round duration - 40 minutes
Round difficulty - Hard
Pointers in C/C++ are variables that store memory addresses. They are used to manipulate memory directly and improve performance.
Pointers are declared using an asterisk (*) before the variable name.
Pointers can be used to dynamically allocate memory using functions like malloc() and free().
Pointers can be used to pass variables by reference to functions.
Tip 1 : Do atleast 1 project
Tip 2 : Practice Data structure programming questions
Tip 3 : Prepare concepts with examples (Coding/Numericals)
Tip 1 : Mention Projects
Tip 2 : Mention only those technologies which you are confident enough.
Tip 3 : Mention extra curricular activities if have.
posted on 4 May 2019
I applied via Referral and was interviewed in Nov 2018. There was 1 interview round.
Fibonacci series can be generated in Informatica using a recursive function.
Create a mapping with a recursive function
Use a variable port to store the previous two values
Use an expression transformation to generate the series
Example: f(0) = 0, f(1) = 1, f(n) = f(n-1) + f(n-2)
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Nov 2021. There were 2 interview rounds.
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 70 Minutes
Round difficulty - Hard
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
Create an array to store the minimum candies required for each student.
Iterate through the students' ratings array to determine the minimum candies needed based on the adjacent ratings.
Consider both left-to-right and right-to-left passes to ensure fair distribution.
Keep track of the total candies dist
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Use Divide and Conquer approach to recursively divide the input array into two halves.
Merge the sorted halves to produce a completely sorted array.
Ensure the implementation handles the constraints specified in the problem statement.
Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Do not put false things on resume.
Tip 2 : Have some projects on resume.
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
based on 13 reviews
Rating in categories
Consultant
86
salaries
| ₹4.5 L/yr - ₹14 L/yr |
Associate Consultant
72
salaries
| ₹3 L/yr - ₹8 L/yr |
SAP MM Consultant
53
salaries
| ₹5 L/yr - ₹12 L/yr |
SAP Fico Consultant
45
salaries
| ₹4 L/yr - ₹15 L/yr |
Senior Consultant
44
salaries
| ₹8.5 L/yr - ₹15.6 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services