Informatica interview questions
Online test → Technical → Technical → Technical → Technical → HR·77% entry level
CS fundamentals
Showing 16 of 162 reported in this area
Explain the difference between a process and a thread
Explain rotations in an AVL tree
Explain Garbage Collection in C++
Explain CPU scheduling algorithms.
Describe subnet mask in IP addressing.
Discuss AVL Trees and their properties
Explain the Producer-Consumer problem.
Explain OOP concepts in detail with examples.
Explain and solve a correlated subquery in SQL
Explain memory allocation in Operating Systems
Explain the CAP theorem in distributed systems
What is the difference between Java 7 and Java 8?
Write an SQL query to find the 3rd highest salary.
Explain advanced OS concepts and Linux command usage.
Explain the internal implementation of HashMap in Java
How can you improve the worst case time complexity of a BST?
DSA
Showing 36 of 153 reported in this area
Check whether a linked list is palindrome
Given a string in encoded form, decode it based on given rules without using a temporary string
Reverse a singly linked list
Check for balanced parentheses
Find the maximum subarray sum in an array
Find the maximum non-contiguous sum from an array
Write a program to check whether a string or number is a palindrome.
Flatten a multi-level linked list
Explain DNA pattern matching techniques
Print the bottom view of a binary tree.
Perform spiral traversal of a given tree
Check whether a given binary tree is a BST
Print the top view of a Binary Search Tree
Print the right view of a Binary Search Tree
Add two large numbers represented as strings.
Find the lexicographic rank of a given string
Find the shortest path in a matrix using BFS.
Compare Quick Sort and Merge Sort with dry run
Explain different types of sorting algorithms.
Implement a stack in Java using generic classes.
Rotate a matrix in-place with space optimization
Implement Tries and analyze their time complexity
Write a program to detect a loop in a linked list.
Find the maximum size square sub-matrix with all 1s
Find the first intersection node of two linked lists
Optimize the code written in the online coding round
Given an array, find the maximum and next maximum sum.
Given a binary matrix, find the number of islands of 1s
Implement a Vector class in C++ with exception handling.
Find a magic index i in a sorted array such that a[i] = i
Find the floor and ceil values from a Binary Search Tree.
Detect a loop in a linked list (write full implementation)
Find the next greater element for each element in an array
Find all root-to-leaf paths in a binary tree with a given sum
Find the maximum non-contiguous subarray sum of a given array.
Given a BST, prune/delete all nodes with values greater than K
Puzzles
Showing 4 of 17 reported in this area
Puzzle: Bags and coins problem.
Logical puzzles asked during interview.
Given four numbers, derive 31 using only +, -, *, /
Given the same four numbers, derive 17 using only +, -, *, /
System design
Showing 3 of 4 reported in this area
Design an elevator system with two lifts and six floors
Low-level system design discussion related to Informatica Developer Tool internal working.
Design how Twitter implements Top Trending Tweets
Behavioural
1 questions reported in this area
Explain how you work efficiently as part of a team
asked oncePractice this →
Showing 60 of 255 questions. Ranked by how often the same question came back across reports.
Practise a Informatica-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Informatica ask?
Candidate interview reports most often cover CS fundamentals (48%) and DSA (45%).
How many rounds does Informatica interview have?
Candidate interview reports show an average of 5.4 rounds per experience, with a typical sequence of Online test → Technical → Technical → Technical → Technical → HR. Individual interview paths can vary.
Is the Informatica interview hard?
Among questions with a reported difficulty, the mix is easy 45%, medium 49%, hard 6%.