Ceipal Senior Software Engineer Interview Questions and Answers

Q1. DSA like stack,
Add your answer
Q2. Framework questions
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Q1. 
Prime Numbers within a Range
Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.
Input:
Integer N
Output:
Prime numbers printed on separate lines
Example:
Input...read more
Ans. 
Generate and print all prime numbers between 2 and N, inclusive.
• Iterate from 2 to N and check if each number is prime

• A prime number is only divisible by 1 and itself

• Print each prime number on a new line
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Q1. 
Anagram Substring Search
Given two strings 'STR' and 'PTR', identify all starting indices of 'PTR' anagram substrings in 'STR'. Two strings are anagrams if one can be rearranged to form the other.
Input:
...read more
Ans. 
Implement a function to find all starting indices of anagram substrings of a given string in another string.
• Create a frequency map of characters in the 'PTR' string.

• Use a sliding window approach to check for anagrams in 'STR'.

• Return the starting indices of anagram substrings found.

• Example: For input 'BACDGABCD' and 'ABCD', output should be [0, 5].
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Q1. What are some common testing questions related to Linux and operating systems?
Ans. 
Common testing questions related to Linux and operating systems
• What are the different types of testing that can be performed on a Linux operating system?

• How do you test the compatibility of software with different Linux distributions?

• Can you explain the process of testing kernel modules in a Linux environment?

• What tools and techniques do you use for performance testing on Linux systems?

• How do you ensure the security an
Answered by AI
Add your answer

Q1. It is taken by manager's manager it is quit tough he asked high level of technical question
Add your answer

Q1. It was just a salary discussion .HR was very corporative and polite.
Add your answer

It started with basic introduction, than move ahead with Java, Spring boot question in the end, he asked one leetcode medium question based on DP . Ques : Find a minimum number of jumps required to reach the end of the array, and each index , it can jump arr[index] time at max, you need to calculate minimum number of steps required to reach at the end.

2 dsa questions need to be implemented in 1hr

Q1. Projects you have worked on. 1. vector implementation in C++
Ans. 
Implemented vector data structure in C++
• Used templates to create a generic vector class

• Implemented basic vector operations like push, pop, insert, erase

• Optimized vector resizing by using exponential growth

• Used iterators to traverse the vector elements

• Implemented vector algorithms like sort and binary search
Answered by AI
Add your answer

Q1. Compensation, expected and other document submitting.
Add your answer

Q1. System Design question on designing a Tiny URL
Add your answer