GE interview questions
Online test → Group discussion → Technical → HR·69% entry level
DSA
Showing 29 of 58 reported in this area
Find the maximum sum of array elements such that no two chosen elements are adjacent.
Find the smallest permutation of a given number considering both negative and positive numbers.
Given an array of size n and a number k, sort the first k elements in non-decreasing order and the last n-k elements in non-increasing order.
Print all prime numbers in the range [2, N].
Given a string, remove all vowels and return the resulting string.
Find the next permutation of a given number.
Compute the next permutation of a given number.
Given integers S, M, and N, compute ((S^M) % 10)^N % 1000000007.
Explain the difference between DFS and BFS and write code for them
Find a triplet in an array whose product is equal to a given number.
Check whether a given binary tree is a subtree of another binary tree.
Find the non-repeating elements in an array without using additional space.
Convert a binary tree into a Sum Tree and count the number of even-valued nodes.
Explain balanced binary trees and perform insertion and deletion in an AVL tree.
Given an integer S and integers M and N, find the value of ((S^M) % 10)^N % 1000000007.
Given an integer N, generate the smallest possible permutation of its digits (unlocking key).
Find all nodes at the maximum depth in a binary tree where all nodes are present at that depth.
Given different coin denominations, find the minimum number of coins required to make a given amount.
Check if a binary tree is a subtree of another binary tree and return the number of nodes in the subtree.
Solve the Subset Sum problem: determine whether there exists a subset of a given set with sum equal to a given value.
Given a boolean matrix, modify it such that if a cell contains 1, all cells in its corresponding row and column are set to 1.
Write a program to rearrange an array such that all negative numbers appear before positive numbers while maintaining their relative order.
Rearrange an array such that all odd numbers occupy odd positions and even numbers occupy even positions, maintaining the order of numbers without using extra space.
Given a string with numbers, '#', underscores, and dots, convert numbers to characters (A=1 to Z=26) unless preceded by '#', replace underscores with spaces, remove spaces, and keep dots unchanged. Example input: "1 20 3.# 20_# 1" → output "ATC.20 1".
Write code to find the middle node of a linked list in the most efficient way.
Rearrange an array so that odd numbers occupy odd positions and even numbers occupy even positions while maintaining relative order and without using extra space.
Find the height of a binary tree.
Reverse all words in a given string.
Print all prime numbers less than 100
CS fundamentals
Showing 24 of 54 reported in this area
Which data structures are used in TCP/IP?
What is segmentation in operating systems?
Explain storage classes extern and register in C.
Explain function overloading and operator overloading.
What are the different storage classes in C? Explain each.
What is a template class in C++ and how is it implemented?
Write an SQL query involving joins and explain how joins work.
Explain different memory management techniques in operating systems
Explain how static polymorphism and runtime polymorphism are implemented.
Predict the output of C/C++ programs involving pointers and bit manipulation
Explain semaphores, threads, deadlocks, and real-time applications of threads.
How is the string class implemented in C++ and how does it differ from char* in C?
Explain various HTTP methods, their uses, differences, and provide sample use cases.
How are threads implemented in Java and why do we need the Thread class or Runnable interface?
What is normalization in DBMS and why is it required? Explain First, Second, and Third Normal Forms.
Explain OOP concepts such as inheritance, polymorphism, function overloading, and function overriding.
Explain OOP concepts such as inheritance, polymorphism, data abstraction, and data encapsulation in Java and C++.
Write code to demonstrate OOPS concepts such as inheritance, function overloading, and data hiding using access specifiers
How can you determine the length of an integer array if only a pointer to the head of the array is given? How is it determined in case of strings?
How would you design a system to manage the state of objects in an application that requires frequent read and write operations, ensuring thread safety?
How is free() implemented when only a pointer to memory is passed and not the length of allocated memory?
What do you mean by DBMS?
Explain exception handling in Java.
Explain different normal forms in DBMS
Behavioural
Showing 3 of 8 reported in this area
Discuss the impact of Internet of Things (IoT) in our daily life, covering both pros and cons.
Digital India: Boon or Bane?
asked oncePractice this →
Will AI replace the human workforce?
asked oncePractice this →
System design
Showing 4 of 5 reported in this area
Suggest an additional feature for Facebook and explain its system architecture.
What new feature would you implement in WhatsApp, and how would you design its architecture?
Design a database schema for a system with customers, products, and orders. Define tables, relationships, and draw the ER diagram.
Design a cab booking system like Ola that allows users to book a cab, search nearby cabs, and estimate the time for a cab to reach the user.
Showing 60 of 107 questions. Ranked by how often the same question came back across reports.
Practise a GE-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does GE ask?
Candidate interview reports most often cover DSA (46%) and CS fundamentals (43%).
How many rounds does GE interview have?
Candidate interview reports show an average of 3.8 rounds per experience, with a typical sequence of Online test → Group discussion → Technical → HR. Individual interview paths can vary.
Is the GE interview hard?
Among questions with a reported difficulty, the mix is easy 50%, medium 47%, hard 3%.