Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Inventia Technology Consultants Team. If you also belong to the team, you can get access from here

Inventia Technology Consultants Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Inventia Technology Consultants Interview Questions and Answers

Updated 5 Oct 2024

Inventia Technology Consultants Interview Experiences

Popular Designations

2 interviews found

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I was interviewed in Sep 2024.

Round 1 - HR 

(2 Questions)

  • Q1. Intro questions
  • Q2. Power system questions

Junior Business Analyst Interview Questions asked at other Companies

Q1. What is the difference between aircraft and airplane?
View answer (1)
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
-
Result
-

I applied via Approached by Company and was interviewed in Nov 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Difference between page view and hits
  • Ans. 

    Page views refer to the number of times a webpage is viewed, while hits refer to the number of requests made to a server for a file.

    • Page views count the number of times a webpage is loaded or refreshed by a user.

    • Hits count the number of requests made to a server for a file, including images, scripts, and other resources.

    • A single page view can generate multiple hits, as each resource on the page requires a separate requ...

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. What is google amp?
  • Ans. 

    Google AMP is an open-source framework that enables faster loading of web pages on mobile devices.

    • AMP stands for Accelerated Mobile Pages

    • AMP pages are stripped down versions of web pages that load quickly on mobile devices

    • AMP pages are cached by Google, which further improves their loading speed

    • AMP is designed to improve user experience and increase engagement on mobile devices

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. What is the importance of seo?
  • Ans. 

    SEO is important for improving website visibility, driving traffic, and increasing brand awareness.

    • SEO helps in improving website ranking on search engines like Google, Bing, etc.

    • It drives organic traffic to the website, which can lead to higher conversions and sales.

    • SEO helps in building brand credibility and awareness by appearing on top of search results.

    • It also helps in optimizing website content and improving user...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - First of all listen the questions carefully what's the interviewer asking and then reply them very confidentially because Confident is very important factor during the interview.

Skills evaluated in this interview

Digital Marketing Executive Interview Questions asked at other Companies

Q1. What is the difference between do follow and no follow links?
View answer (5)

Jobs at Inventia Technology Consultants

View all

Interview questions from similar companies

I applied via Naukri.com and was interviewed before May 2021. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Discuss 4 case study related to supply chain management.

Interview Preparation Tips

Topics to prepare for Tech Mahindra Senior Software Engineer interview:
  • Supply Chain Management
Interview preparation tips for other job seekers - Develop some case study of your own and also deep analysis for each.

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 180 min
Round difficulty - Hard

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The problem involves finding the length of the longest common subsequence between two given strings.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the lengths of common subsequences of substrings.

    • Iterate through the strings to fill the array and find the length of the longest common subsequence.

    • Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'ac

  • Answered by AI
  • Q2. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q3. 

    K Largest Elements Problem Statement

    You are given an unsorted array containing 'N' integers. Your task is to find the 'K' largest elements from this array and return them in non-decreasing order.

    Input:

    T...
  • Ans. 

    Yes, the problem can be solved in less than O(N*log(N)) time complexity using the Quick Select algorithm.

    • Implement Quick Select algorithm to find the Kth largest element in O(N) time complexity.

    • Partition the array around a pivot element and recursively search in the left or right partition based on the position of the pivot.

    • Once you find the Kth largest element, return all elements greater than or equal to it in non-de

  • Answered by AI
Round 2 - Coding Test 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Size of Largest BST in a Binary Tree

    Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a Binary Search Tree (BST).

    Explanation:

    A Binary Search Tree (BST) is def...

  • Ans. 

    Find the size of the largest BST subtree in a binary tree.

    • Traverse the tree in a bottom-up manner to check if each subtree is a BST.

    • Keep track of the size of the largest BST found so far.

    • Recursively check if the current subtree is a BST and update the size accordingly.

  • Answered by AI
  • Q2. 

    Matrix Chain Multiplication Problem

    Given 'N' 2-dimensional matrices and an array ARR of length N + 1, where the first N integers denote the number of rows in each matrix and the last integer represents t...

  • Ans. 

    Find the minimum number of multiplication operations required to multiply a series of matrices together.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the minimum number of operations needed to multiply matrices.

    • Iterate through different combinations of matrices to find the optimal solution.

    • Consider the dimensions of the matrices to determine the number of operations required.

    • Calcu...

  • Answered by AI
  • Q3. 

    Rotate Linked List Problem Statement

    Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.

    Example:

    Input:
    Li...
  • Ans. 

    Rotate a linked list by K positions in a clockwise direction.

    • Traverse the linked list to find the length and the last node.

    • Connect the last node to the head to form a circular linked list.

    • Find the new head by moving (length - K) steps from the last node.

    • Break the circular list at the new head to get the rotated linked list.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

  • Q1. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...

  • Ans. 

    Given a string, find the longest palindromic substring within it.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found so far

    • Return the longest palindromic substring

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7 CGPAJosh Technology Group interview preparation:Topics to prepare for the interview - DSA, OOPS, OS, CN, DBMS, atleast one languageTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : be thoroughly prepared with dsa
Tip 2 : focus on dbms.
Tip 3 : be prepared with skills mentioned in resume

Application resume tips for other job seekers

Tip 1 : mention some good projects
Tip 2 : don't put false statement

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - MCQ 

(1 Question)

  • Q1. IT WAS MCQ CODING OUTPUT BASED ROUND IN WHICH TOTAL 45 QUESTION
Round 2 - SUBJECTIVE ROUND 

(1 Question)

  • Q1. IT WAS SUBJECTIVE CODING ROUND IN WHICH 1 OUTPUT BASED AND 3 CODING ROUND
Round 3 - Coding Test 

IT WAS 3RD CODING ROUND IN WHICH 3 CODING QUESTIONS AND DURATION 75MIN

Interview Preparation Tips

Interview preparation tips for other job seekers - PREPRARE FOR
LINKEDLIST
TREE
AND ADVANCE DSA

I was interviewed in May 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

It was just after the first round in the morning

  • Q1. 

    Huffman Coding Challenge

    Given an array ARR of integers containing 'N' elements where each element denotes the frequency of a character in a message composed of 'N' alphabets of an alien language, your ta...

  • Ans. 

    Implement a function to generate Huffman codes for characters based on their frequencies in an alien language message.

    • Use a priority queue to build the Huffman tree efficiently.

    • Assign '0' and '1' to left and right branches of the tree respectively to generate unique binary codes.

    • Ensure that each code distinctly identifies its corresponding character and minimizes the total number of bits used for the message.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

1 hr after the second round got over and results were announced in the morning.

  • Q1. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to find the total number of ways to make change for a specified value using given denominations.

    • Create a dynamic programming table to store the number of ways to make change for each value up to the target value.

    • Iterate through each denomination and update the table accordingly based on the current denomination.

    • The final answer will be the value in the table at the target value.

    • Consider edge cases such as w...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

10 A.M in the morning.
The interviewers were very knowledgeable and humble

  • Q1. 

    Unique Element In Sorted Array

    Nobita wants to impress Shizuka by correctly guessing her lucky number. Shizuka provides a sorted list where every number appears twice, except for her lucky number, which a...

  • Ans. 

    Find the unique element in a sorted array where all other elements appear twice.

    • Iterate through the array and XOR all elements to find the unique element.

    • Use a hash set to keep track of elements and find the unique one.

    • Sort the array and check adjacent elements to find the unique one.

  • Answered by AI
  • Q2. 

    Find Nodes at Distance K in a Binary Tree

    Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...

  • Ans. 

    Find all nodes at distance K from a given node in a binary tree.

    • Perform a depth-first search starting from the target node to find nodes at distance K.

    • Use a recursive function to traverse the tree and keep track of the distance from the target node.

    • Maintain a set to store visited nodes and avoid revisiting them.

    • Return the list of nodes found at distance K from the target node.

    • Example: For the given input tree, target n...

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

It was after the first technical interview round.
Got a mail for the second interview round .
Timings approx 12 AM

  • Q1. 

    Remove BST Keys Outside Given Range

    Given a Binary Search Tree (BST) and a specified range [min, max], your task is to remove all keys from the BST that fall outside this range. The BST should remain vali...

  • Ans. 

    Remove keys outside given range from a Binary Search Tree while keeping it valid.

    • Traverse the BST in inorder and remove nodes outside the specified range

    • Recursively check left and right subtrees for nodes to remove

    • Update pointers to maintain the validity of the BST

    • Return the inorder traversal of the adjusted BST

  • Answered by AI
  • Q2. 

    Inorder Successor in a Binary Tree

    Given an arbitrary binary tree and a specific node within that tree, determine the inorder successor of this node.

    Explanation:

    The inorder successor of a node in a bi...

  • Ans. 

    Given a binary tree and a specific node, find its inorder successor in the tree.

    • Perform an inorder traversal of the binary tree to find the successor node.

    • If the given node has a right child, the successor is the leftmost node in the right subtree.

    • If the given node does not have a right child, backtrack to find the ancestor whose left child is the given node.

  • Answered by AI
Round 5 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

Got a call from Hr after clearance of the first 2 rounds.
Timing were 5:30 P.M

Interview Preparation Tips

Eligibility criteria7+ CGPAJosh Technology Group interview preparation:Topics to prepare for the interview - DBMS, OS, OOPS, Data Structure, Array, String, Bit manipulation, BInary Search, Sorting, Number Theory Linked List, Trees, Graph, DPTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Focus the most on Data Structure topics and practice atleast 300 medium level ques (min 2 approaches for each qs)
Tip 2 : Have a strong grip on Core Subjects i.e OS, DBMS, OOPS, CN, System Design(for big mnc's)
Tip 3 : Learn any good development framework and make min 2 good projects with that and try to do any 1 or 2 min intern to put it in your resume.

Application resume tips for other job seekers

Tip 1 : Keep it short and to the point
Tip 2 : Have good knowledge of every single thing you mentioned there.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.

  • Q1. 

    Validate Binary Tree Nodes Problem

    You are provided with 'N' binary tree nodes labeled from 0 to N-1, where node i has two potential children, recorded in the LEFT_CHILD[i] and RIGHT_CHILD[i] arrays. Dete...

  • Ans. 

    The task is to determine if the given binary tree nodes form exactly one valid binary tree.

    • Check if there is only one root node (a node with no parent)

    • Check if each node has at most one parent

    • Check if there are no cycles in the tree

    • Check if all nodes are connected and form a single tree

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Medium

This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.

  • Q1. 

    Balanced Binary Trees Problem Statement

    You are provided with an integer 'H'. Your task is to determine and print the maximum number of balanced binary trees possible with height 'H'.

    A balanced binary t...

  • Ans. 

    The maximum number of balanced binary trees possible with a given height is to be counted and printed.

    • A balanced binary tree is one in which the difference between the left and right subtree heights is less than or equal to 1.

    • The number of balanced binary trees can be calculated using dynamic programming.

    • The number of balanced binary trees with height 'H' can be obtained by summing the product of the number of balanced...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.

  • Q1. 

    Wave Array Sorting Problem

    Your goal is to sort a given unsorted array ARR such that it forms a wave array.

    Explanation:

    After sorting, the array should satisfy the wave pattern conditions:

    • ARR[0] &...
  • Ans. 

    The task is to sort an array in a wave form, where each element is greater than or equal to its adjacent elements.

    • Iterate through the array and swap adjacent elements if they do not follow the wave pattern

    • Start from the second element and compare it with the previous element, swap if necessary

    • Continue this process until the end of the array

    • Repeat the process for the remaining elements

    • Return the sorted wave array

  • Answered by AI
  • Q2. 

    Maximum Sum BST Problem Statement

    You are presented with a Binary Tree 'root', which may not necessarily be a Binary Search Tree (BST). Your objective is to identify the maximum sum of node values in any ...

  • Ans. 

    The task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).

    • Traverse the binary tree in a bottom-up manner

    • For each node, check if it forms a BST and calculate the sum of its subtree

    • Keep track of the maximum sum encountered so far

    • Return the maximum sum

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 135 minutes
Round difficulty - Hard

This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.

  • Q1. 

    Pair Sum in BST Problem Statement

    Given a Binary Search Tree (BST) and a target value K, determine if there exist two unique elements in the BST such that their sum equals K.

    Input:

    An integer T, the nu...
  • Ans. 

    The task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target 'K'.

    • Traverse the BST in-order and store the elements in a sorted array

    • Use two pointers, one at the beginning and one at the end of the array

    • Check if the sum of the elements at the two pointers is equal to the target 'K'

    • If the sum is less than 'K', move the left pointer to the right

    • If the sum is grea...

  • Answered by AI
  • Q2. 

    Find Nodes at Distance K in a Binary Tree

    Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Implement a function that takes the binary tree, target node, and distance K as input.

    • Use a depth-first search (DFS) algorithm to traverse the tree and find the nodes at distance K.

    • Keep track of the distance from the current node to the target node while traversing.

    • When the distance equals K, add the current node to the result lis...

  • Answered by AI
Round 5 - HR 

Round duration - 20 minutes
Round difficulty - Easy

This was the simple 20 minutes round

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Raj Kumar Goel Institute Of Technology. Eligibility criteriaNo criteriaJosh Technology Group interview preparation:Topics to prepare for the interview - Linked list, Tree, Graph, Dynamic Programming, Recursion, BacktrackingTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Try to solve some good questions from every topic.
Tip 2 : If not have much time, then you can solve top interview questions from Leetcode.
Tip 3 : Made 2-3 good projects using any technology

Application resume tips for other job seekers

Tip 1 : Keep resume short and crispy.
Tip 2 : Add coding profile handles and github link.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

All multiple-choice questions on object-oriented programming and pointers.

Round 2 - Coding Test 

Questions related to linked lists and trees.

Round 3 - Coding Test 

Three questions, all regarding LinkedIn, focusing on lists and trees.

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via Campus Placement and was interviewed in Jul 2024. There were 3 interview rounds.

Round 1 - Aptitude Test 

Basic multiple-choice questions on programming languages.

Round 2 - Coding Test 

DSA round 1 , 3 questions on arrays, LL, trees

Round 3 - Coding Test 

DSA round 2 : 3 questions on stack and queue, trees, dp

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

In first round there were two test
1st is the personality test.
2nd is the aptitude test were they asked about 10 aptitude questions and around 40 coding based questions, some of them were mcq and rest were output based.

Round 2 - Coding Test 

Contains 4 DSA based questions, 1 question was hard, and other 3 questions were of medium level.

Interview Preparation Tips

Interview preparation tips for other job seekers - You should be well prepared of the Josh Technology Group, you should be very good in coding and should know DSA very well.

Inventia Technology Consultants Interview FAQs

How many rounds are there in Inventia Technology Consultants interview?
Inventia Technology Consultants interview process usually has 2-3 rounds. The most common rounds in the Inventia Technology Consultants interview process are Technical, HR and Resume Shortlist.
How to prepare for Inventia Technology Consultants interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Inventia Technology Consultants. The most common topics and skills that interviewers at Inventia Technology Consultants expect are Postgresql, SQL Server, C#, Database Design and Database Maintenance.
What are the top questions asked in Inventia Technology Consultants interview?

Some of the top questions asked at the Inventia Technology Consultants interview -

  1. What is the importance of s...read more
  2. Difference between page view and h...read more
  3. What is google a...read more

Tell us how to improve this page.

Inventia Technology Consultants Interview Process

based on 3 interviews

Interview experience

2.7
  
Poor
View more

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.5k Interviews
Infosys Interview Questions
3.6
 • 7.6k Interviews
Wipro Interview Questions
3.7
 • 5.7k Interviews
Tech Mahindra Interview Questions
3.5
 • 3.9k Interviews
HCLTech Interview Questions
3.5
 • 3.8k Interviews
LTIMindtree Interview Questions
3.8
 • 3k Interviews
Mphasis Interview Questions
3.4
 • 810 Interviews
View all

Inventia Technology Consultants Reviews and Ratings

based on 18 reviews

3.9/5

Rating in categories

3.6

Skill development

4.0

Work-life balance

3.5

Salary

3.7

Job security

3.4

Company culture

3.4

Promotions

3.7

Work satisfaction

Explore 18 Reviews and Ratings
Java Developer / Senior Java Developer

Noida

3-8 Yrs

Not Disclosed

Postgresql Administrator

Noida

5-8 Yrs

Not Disclosed

Data Analyst (AI/ML)

Noida

0-1 Yrs

₹ 2-3.5 LPA

Explore more jobs
Software Developer
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Quality Analyst
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Engineer
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Android Developer
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Android App Developer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Inventia Technology Consultants with

Infosys

3.6
Compare

TCS

3.7
Compare

Wipro

3.7
Compare

HCLTech

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview