Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
Top trending discussions
I applied via Naukri.com and was interviewed in Jul 2021. There were 3 interview rounds.
The Python code to get the output string as 'jareen arpohc' from the input string 'neeraj chopra' is provided.
Split the input string into individual words
Reverse each word
Join the reversed words with a space in between
Code to list even numbers from a given list of 10 numbers.
Loop through the list of numbers
Check if each number is even using the modulo operator
If the number is even, add it to a new list of even numbers
Return the new list of even numbers
Reversing a string in Python code
Use slicing to reverse the string
Use the built-in function 'reversed()'
Convert the string to a list, reverse it, and then join it back to a string
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2021. There were 3 interview rounds.
posted on 19 Dec 2022
I applied via Recruitment Consulltant and was interviewed in Nov 2022. There were 2 interview rounds.
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 Campus Placement and was interviewed before Aug 2020. There were 4 interview rounds.
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
based on 1 interview
Interview experience
Associate Consultant
98
salaries
| ₹3 L/yr - ₹10 L/yr |
Consultant
94
salaries
| ₹4.5 L/yr - ₹18.4 L/yr |
Senior Consultant
31
salaries
| ₹11.1 L/yr - ₹22 L/yr |
Associate Technical Consultant
11
salaries
| ₹3.2 L/yr - ₹5.4 L/yr |
Lead Consultant
9
salaries
| ₹20 L/yr - ₹24 L/yr |
Medcode
Maxgen Technologies
Cyfuture
Value Point Systems