Ceipal Software Engineer Interview Questions, Process, and Tips

Basic string manipulation and general DSA questions

Q1. Tree traversal iteratively
Add your answer
Q2. Implement DFS,BFS on graph
Add your answer

There will be 3 coding questions given to us for solving,we need solve two questions compulsory.

Q1. Introduce yourself
Ans. 
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring, and Angular

• Strong problem-solving skills
Answered by AI
Add your answer
Q2. Questions related to frontend
Add your answer

Reverse Linked List
Pallindrome of String

Flyover building in team with strength

Q1. Tell me about yourself?
Add your answer

4 coding ques + 15 technical aptitude

4 Coding Ques + 10 technical aptitude

Q1. Coding question
Add your answer
Q2. Group by query, dbms
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

Q1. 
Rectangle Area Calculation
Given a list of rectangles, where each rectangle is represented by an array of four integers indicating its bottom-left and top-right corners, calculate the total area covered b...read more
Ans.  Coordinate Compression
• As we can have only 200 distinct rectangles with us so we don’t need to worry about point constraint, we can use the coordinate compression technique to map these points all The x-axis points and y-axis points as well.
• Now these mapped coordinates can be used to form our grid. we can make a grid grid[x][y] = True for rx1 <= x < rx2 and ry1 <= y < ry2. Where rx1 , rx2, ry1, ry2 correspo...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Oops concepts and 1 DSA problem

Q1. 
Bit Set Problem Statement
You are provided with a string, termed as DIGIT_PATTERN, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no...read more
Ans. Brute Force
The basic idea of the approach is that we iterate for each index ‘i’ digit in the string ‘DIGIT_PATTERN’, and store the occurrence of that digit in the array/list ‘store’. At any index ‘i’, if the occurrence of the digit is already 1 in the array/list ‘store’, then we would return that digit Or else if the digit has occurred for the first time in the iteration then make the value 1 at index ‘digit’ in the ar...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Firstly Some general questions and then suddenly a cosing question with modifications

Q1. 
Print All Permutations of a String
Given an input string STR, generate and print all possible permutations of the string.
Input:
str
Output:
All permutations of the input string, each on a new line.
...read more
Ans. 
Recursively solved 1stl one
Then applied set data structure to solve second one
Answered Anonymously
Add your answer