i
GEP Worldwide
Filter interviews by
I applied via Campus Placement and was interviewed before May 2023. There were 4 interview rounds.
Asked aptitude questions, core CS, Hadoop and DSA
Top trending discussions
Easy to medium test was easily solvable
Quantitative and Verbal
2 Questions - DSA (Array and Numbers)
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
It was easy to crack so easy
Questions about technical skills
Questiona asketd related to array string binary seach tree
I am a software engineer with 5 years of experience in developing web applications using various technologies.
5 years of experience in software engineering
Specialize in developing web applications
Proficient in various technologies
Developed a mobile app for tracking daily water intake and setting hydration goals.
Implemented user-friendly interface for inputting water consumption
Utilized push notifications to remind users to drink water throughout the day
Incorporated gamification elements to motivate users to reach their hydration goals
The shortest distance between two farthest vertices in a cubical room is the length of the diagonal of the cube.
The diagonal of a cube can be calculated using the formula: sqrt(3) * side length
In a cube with side length 1 unit, the diagonal length is sqrt(3) units
Therefore, the shortest distance between two farthest vertices in a cubical room is sqrt(3) times the side length of the cube
I appeared for an interview in Apr 2022.
Round duration - 180 minutes
Round difficulty - Hard
There was 1 round of 180 minutes which contains of 3 questions from DSA. the two question was of medium level but one question is of neither difficult nor medium level question based on tree
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to keep track of the longest increasing subsequence ending at each element.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the ar...
Check whether a given graph is bipartite or not. Return true
if the graph's vertices can be divided into two independent sets, ‘U’ and ‘V’, such that every edge (‘u’, ‘v’) either c...
Check if a given graph is bipartite by dividing vertices into two independent sets.
Use BFS or DFS to traverse the graph and assign colors to vertices to check for bipartiteness.
If an edge connects vertices of the same color, the graph is not bipartite.
Return true if all edges connect vertices of different colors, else return false.
Given an integer array ARR
of size N
containing all distinct values, determine the total number of inversions present in the array.
An inversion is defined for a pair o...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the conditions for inversion are met.
Use a nested loop to compare each element with all elements to its right.
Keep a count of the inversions found and return the total count at the end.
Round duration - 50 minutes
Round difficulty - Medium
In interview I was asked about some question related to Data structures , DBMS . Some output based question was asked and 2 coding problems was given to solve.
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
A subset of an array 'ARR' is a tupl...
Given an array and an integer, return all subsets that sum to the given integer.
Use backtracking to generate all possible subsets of the array.
For each subset, check if the sum equals the given integer 'K'.
Print the subsets that satisfy the condition.
Example: For input [1, 2, 3] and K=3, subsets [1, 2] and [3] have sum 3.
Given a binary tree of integers, your task is to print the boundary nodes of the binary tree in an anti-clockwise direction starting from the root node.
The boundary...
Boundary traversal of a binary tree in anti-clockwise direction starting from the root node.
Implement a function to calculate the boundary traversal of a binary tree
Include nodes from left boundary, leaf nodes, and right boundary in sequence
Ensure only unique nodes are included in the output
Print the boundary nodes separated by single spaces for each test case
Tip 1 - Practice At least 250 Questions of DS algo
Tip 2 - Do at least 2 application based projects
Tip 3 - Practice questions with optimized approaches
Tip 1 : Have some application based projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Project should clear and crisp
Basic MCQs on CS concepts
I have written a project code for a web application that tracks user activity and generates reports.
Used HTML, CSS, and JavaScript for front-end development
Utilized PHP and MySQL for back-end development
Implemented user authentication and data visualization features
based on 1 interview
Interview experience
Software Engineer
546
salaries
| ₹4.7 L/yr - ₹16 L/yr |
Senior Consultant
370
salaries
| ₹13 L/yr - ₹28 L/yr |
Process Associate
369
salaries
| ₹1.7 L/yr - ₹3.5 L/yr |
Senior Sourcing Analyst
354
salaries
| ₹4.8 L/yr - ₹10.7 L/yr |
Purchasing Specialist
310
salaries
| ₹2.3 L/yr - ₹6.1 L/yr |
Accenture
IBM
Infosys
TCS