21 questions · from 5 interviews
Concentric Ai interview questions
Every question candidates reported from their Concentric Ai interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.
Concentric Ai coding and DSA questions
- 01
Linked List Rearrange
Solve the linked list rearrange problem as described at the provided link.
- 02
Intersection of Two Linked Lists
Given the heads of two singly linked lists, return the node at which the two lists intersect.
- 03
Kth Next Greater Element to the Right
For each element in an array, find the kth next greater element to its right. This is a variant of the Next Greater Element IV problem.
- 04
Height Checker
Given an array of student heights, sort the array in ascending order and count how many students are not in the same index as they were in the original array. Input: arr = [1, 1, 4, 2, 1, 3] Output: Number of mismatched positions after sorting. This…
Easy · From Concentric AI OA 2026 | 3 Questions | LC 1051 + Weighted Median + Bitwise OR DP
- 05
Minimum Travel Cost (Weighted Manhattan Median)
Given three arrays numPeople[], X[], and Y[] where numPeople[i] is the number of people at coordinate (X[i], Y[i]), choose a meeting point (x, y) that minimizes the total Manhattan travel cost: Σ numPeople[i] (|x - X[i]| + |y - Y[i]|). Example: numPeople =…
Medium · From Concentric AI OA 2026 | 3 Questions | LC 1051 + Weighted Median + Bitwise OR DP
- 06
Maximum Profit with Bitwise OR Constraint
Given integers N and K, and two arrays A[] and B[], select a subset of indices such that the bitwise OR of the selected A values is less than or equal to K, and the sum of the corresponding B values is maximized. Formally, find a subset S of indices where:…
Hard · From Concentric AI OA 2026 | 3 Questions | LC 1051 + Weighted Median + Bitwise OR DP
- 07
Merge K Sorted Lists
Given an array of k linked‑list heads, merge them into one sorted linked list and return its head.
Medium · From Concentric.AI | Bad Experience with Architect Round
- 08
Payout Rule Engine
Implement a payout rule engine that decides to ACCEPT or REJECT a payment based on vendor history. Example rule: if the total amount paid by a vendor in the last 7 days exceeds 10 Lakh, reject the payment. Input: {vendorid, amount, timestamp}. Output:…
Medium · From Concentric.AI | Bad Experience with Architect Round
- 09
Maximize Tree Sum by Removing Subtrees
Given a tree with positive and negative values, remove some (possible zero) nodes along with their entire subtree such that the sum of values of the remaining tree - kX is maximized, where k is a fixed constant given in the question and X is the number of…
Hard · From I've got it guys! Concentric AI (SDE-1) interview experience
- 10
Heap Implementation in C++
What data structures are used for the implementation of a heap (or priorityqueue) in C++?
Medium · From I've got it guys! Concentric AI (SDE-1) interview experience
- 11
Implement Heap using BST
Implement a heap (specifically, its push(), pop(), and peek() functions) using a Binary Search Tree (BST) data structure.
Medium · From I've got it guys! Concentric AI (SDE-1) interview experience
- 12
Find Top K Most Frequent Elements in an Array
Find Top K Most Frequent Elements in an Array. Follow-up: How would you solve it if the array was a stream?
From Concentric.ai | Senior Software Engineer | Bangalore | Feb 2025
- 13
Edit Distance with Add/Remove Only
Variation of Edit Distance, given a condition that only add or remove operations are allowed.
From Concentric.ai | Senior Software Engineer | Bangalore | Feb 2025
- 14
Trapping Rainwater Problem
Trapping Rainwater Problem
From Concentric.ai | Senior Software Engineer | Bangalore | Feb 2025
Concentric Ai system design questions
- 01
Design a Metadata System
Design a highly available metadata system for uploaded video files. Requirements include processing videos to generate metadata (multiple resolutions, size, transcription, access control), providing analytics (e.g., who created the most videos in the last…
- 02
Design Snake Game
Design a Snake Game for a Nokia Phone with the following functional requirements: An arena of N x N. The snake does not move automatically; movement is based on user input. The snake can move in all four directions. Random food spawns; later, food might…
From Concentric.ai | Senior Software Engineer | Bangalore | Feb 2025
Concentric Ai behavioural and HR questions
- 01
Why Software Developer?
Why do you want to be a software developer?
From I've got it guys! Concentric AI (SDE-1) interview experience
- 02
Behavioral: Co-curriculars & Future Goals
Discuss co-curricular activities done in the institute and future expectations and goals.
From I've got it guys! Concentric AI (SDE-1) interview experience
Concentric Ai other questions
- 01
C++ Memory Storage (Stack vs Heap)
What data structures are used to store objects in C++? Explain the working of stacks for static data and heaps for dynamic data.
Easy · From I've got it guys! Concentric AI (SDE-1) interview experience
- 02
Networking Concepts: IPv4 vs IPv6, Subnetting
Explain IPv4 vs IPv6, the need for IPv6, Subnetting, and Subnet Mask.
Easy · From I've got it guys! Concentric AI (SDE-1) interview experience
- 03
OS: Paging and Virtual Memory
Explain paging and virtual memory, specifically how a 200GB game can run on 8GB RAM.
Medium · From I've got it guys! Concentric AI (SDE-1) interview experience
Concentric Ai interview questions FAQ
What questions are asked in Concentric Ai interviews?
Candidates reported 21 distinct questions across 5 Concentric Ai interviews. 14 coding and DSA questions, 2 system design questions, 2 behavioural and HR questions, 3 other questions.
How difficult are Concentric Ai interview questions?
Of the questions candidates rated, 27% were easy, 55% medium and 18% hard.