Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Celigo SDE Intern Interview Questions and Answers

Updated 27 Jul 2023

Celigo SDE Intern Interview Experiences

1 interview found

SDE Intern Interview Questions & Answers

user image Anonymous

posted on 27 Jul 2023

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Jun 2023. 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 Resume tips
Round 2 - Coding Test 

2 coding question bitmasking and dfs

Round 3 - One-on-one 

(2 Questions)

  • Q1. Rain water trapping leetcode question
  • Q2. Hashing basis easy question from leetcode
Round 4 - One-on-one 

(1 Question)

  • Q1. Job schedule leetcode easy question

Interview questions from similar companies

I applied via Referral

Interview Questionnaire 

6 Questions

  • Q1. Your contribution in your projects?
  • Ans. 

    I have contributed to my projects by developing and implementing new features, fixing bugs, and improving overall performance.

    • Developed and implemented new features

    • Fixed bugs and issues

    • Improved overall performance

    • Collaborated with team members to ensure project success

    • Provided technical support and troubleshooting assistance

  • Answered by AI
  • Q2. How you resolve problems within team?
  • Ans. 

    I encourage open communication and collaboration to identify and solve problems within the team.

    • Encourage open communication and active listening

    • Identify the root cause of the problem

    • Brainstorm solutions as a team

    • Assign tasks and follow up on progress

    • Evaluate the effectiveness of the solution

    • Provide constructive feedback

    • Celebrate successes and learn from failures

  • Answered by AI
  • Q3. What are your expectations from the company?
  • Ans. 

    I expect a company that values innovation, growth opportunities, and work-life balance.

    • Opportunities for professional development and growth

    • A culture that encourages innovation and creativity

    • A healthy work-life balance

    • Clear communication and transparency

    • Competitive compensation and benefits

    • Collaborative and supportive team environment

  • Answered by AI
  • Q4. Do you have any plans of higher studies?
  • Ans. 

    Yes, I am planning to pursue a Master's degree in Computer Science.

    • I am interested in specializing in Artificial Intelligence.

    • I have already researched and shortlisted a few universities.

    • I plan to apply for the next academic year.

    • I believe higher studies will help me gain a deeper understanding of the field and advance my career.

  • Answered by AI
  • Q5. How flexible you are in professional life?
  • Ans. 

    I am very flexible in my professional life and can adapt to changing situations easily.

    • I am open to learning new technologies and skills

    • I can work in different environments and with different teams

    • I am willing to take on new challenges and responsibilities

    • I can adjust my work schedule to meet project deadlines

    • I am comfortable with remote work and flexible work arrangements

  • Answered by AI
  • Q6. Tell me about your self?
  • Ans. 

    I am a software engineer with experience in developing web applications and a passion for problem-solving.

    • Experienced in developing web applications using languages such as Java, Python, and JavaScript

    • Proficient in using frameworks such as Spring, Django, and React

    • Strong problem-solving skills and ability to work in a team environment

    • Passionate about learning new technologies and keeping up with industry trends

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 55 questions in 60 minutes of which 45 were technical and 10 were aptitude questions and there was no negative marking. The technical questions covered RDBMS, UNIX, C, C++, Java, Operating systems, Data structures and Algorithms. The questions were simple and the basics of each of the mentioned subjects were mainly asked.
Duration: 60 minutes
Total Questions: 55

Round: Test
Experience: Again mainly questions on the subjects covered in round 1 but bit more in deep questions required short but detailed answers.
Tips: Learn to write pretty good Unix Scripts and Know the Basics of Operating System & OOP
Duration: 40 minutes
Total Questions: 10

Round: Technical Interview
Experience: Questions mainly on UNIX & RDBMS. Interviewer will ask you to write UNIX scripts and SQL/JAVA-SQL queries/programs for some use cases.
Tips: Know how JOINS, INTERSECTION, UNION & Aggregation works in SQL.

Round: Technical Interview
Experience: Questions on Programming, Data Structure and algorithms.
You will be asked to write pseudo-program for some of the use cases.
Tips: Choose your programming language cleverly. ;)

Round: Other Interview
Experience: Round 5 is an interview with Technical Manager.
Questions are asked based on the content of your resume like projects, hobbies and traits.
Few puzzle questions are asked which usually can be answered with logical analysis.
Tips: Be prepared for questions on the answer you give for the previous question(s).

Round: HR Interview
Experience: Again question will be asked on the basis of your resume. Questions may also asked on your previous interview experience if you have any.
Tips: Clear your doubts before leaving the room.

General Tips: Be confident, be straight forward, do not try to bluff with answers and try to be creative with answers. Prepare well both technical and aptitude.
Skills: Algorithms And Data Structures, Operating Systems, Unix, SQL, Java Programming, Object-Oriented Programming (OOP), C Programming
College Name: JSS Mahavidyapeetha Sri Jayachamarajendra College Of Engineering, Mysore
Motivation: Work Environment of Informatica.

Interview Preparation Tips

Round: Test
Experience: Round 1: Online objective test.
There were questions from Operating Systems, C, Algorithms, Data Structures.

Round 2: Online and subjective (choose language C++ or JAVA). This round had 15 questions.
Data structures, C++ questions, Fibonacci optimisation, algorithms (DFS/BFS).

Round: Technical Interview
Experience: In the first round of interview they asked me questions about :1) My project (asked no. of classes and mention their responsibilities).
2) ACID properties of database and indexing in a database.

There were also questions related to OOPS concepts including polymorphism, composition, aggregation, inheritance, Abstract classes, interface; difference between usage of abstract class and interface, can abstract class be instantiated, how to access child class methods having reference of base class.
There was another question on run time and compile time binding and under which category do we classify method overloading and also questions on code for deleting the duplicate nodes in a sorted link list and printing root to leaf paths in a binary search tree.

Round: Technical Interview
Experience: This was the second round of the interview. They asked me the following questions,There is a tree (not binary) and all non-leaf nodes are RED in colour. Some leaf nodes are white in colour. If a node has all white coloured children then its colour can be changed into white. So we have to convert maximum number of nodes into white colour – write program for the same.
Code for checking whether a given binary tree balanced or not.
What are virtual functions, what is their role?
Questions related to virtual functions.

You are given the details of each transaction of each item i.e. item_name, quantity, price. So at the end of the day, you want top 50 items that have been sold. There are two cases:
In the first case you have fixed number of items.
In the second case very large number of items – so you need to decide what data structure to be used for this.

Round: Technical Interview
Experience: In the third round of the interview they asked questions like :
1) Types of tree traversals (breadth first and depth first (pre, post, in)
2) Determining width of binary tree i.e. using breadth wise traversal
3) Why files are preferred over databases?

College Name: IIT KANPUR

Interview Questionnaire 

11 Questions

  • Q1. Asked about my project? Also asked me questions about ACID properties of database and indexing in a database
  • Q2. There were also questions related to OOPS concepts including polymorphism, composition, aggregation, inheritance, Abstract classes, interface; difference between usage of abstract class and interface, can ...
  • Q3. There was another question on run time and compile time binding and under which category do we classify method overloading
  • Q4. Code for deleting the duplicate nodes in a sorted link list?
  • Ans. 

    Code to delete duplicate nodes in a sorted linked list

    • Traverse the linked list and compare adjacent nodes

    • If nodes are equal, delete one of them

    • Repeat until all duplicates are removed

  • Answered by AI
  • Q5. Printing root to leaf paths in a binary search tree
  • Ans. 

    Printing all root to leaf paths in a binary search tree

    • Traverse the tree recursively and keep track of the current path

    • When a leaf node is reached, add the current path to the list of paths

    • Print all the paths in the list

    • Use an array of strings to store the paths

  • Answered by AI
  • Q6. Given an Array of Integers, Find two elements in the array whose sum is closest to zero?
  • Ans. 

    Find two integers in an array whose sum is closest to zero.

    • Sort the array in ascending order.

    • Initialize two pointers at the beginning and end of the array.

    • Move the pointers towards each other until the sum is closest to zero.

  • Answered by AI
  • Q7. What are virtual functions, what is their role? Questions related to virtual functions?
  • Q8. You are given the details of each transaction of each item i.e. item_name, quantity, price. So at the end of the day, you want top 50 items that have been sold. There are two cases: - In the first case you...
  • Q9. How do you quickly count the number of set bits in a 32-bit integer in linear time (with respect to the number of set bits)?
  • Ans. 

    Count set bits in a 32-bit integer in linear time

    • Use bit manipulation to count set bits

    • Divide the integer into 16-bit chunks and count set bits in each chunk

    • Use lookup tables to count set bits in each 8-bit chunk

    • Use parallel processing to count set bits in multiple integers simultaneously

  • Answered by AI
  • Q10. Determining width of binary tree i.e. using breadth wise traversal
  • Ans. 

    To determine the width of a binary tree using breadth-wise traversal, we need to count the number of nodes at each level.

    • Perform a breadth-first traversal of the binary tree

    • Count the number of nodes at each level

    • Keep track of the maximum number of nodes seen at any level

    • Return the maximum number of nodes seen

  • Answered by AI
  • Q11. Why files are preferred over databases?
  • Ans. 

    Files are preferred over databases for certain types of data and applications.

    • Files are faster for small amounts of data.

    • Files are easier to manage and backup.

    • Files are more flexible for certain types of data, such as images or videos.

    • Databases are better for complex data relationships and queries.

    • Databases are more secure and scalable for large amounts of data.

    • The choice between files and databases depends on the spec

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were questions from Operating Systems, C, Algorithms, Data Structures

Round: Test
Experience: This round had 15 questions.Data structures, C++ questions, algorithms (DFS/BFS)

Skills: java, OOP, Algorithm
College Name: IIT KANPUR

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 Sep 2024. There were 3 interview rounds.

Round 1 - Coding Test 

90mins were there and we have to solve 2 coding questions along with mcqs question related to oops, sql, java, it infrastructure, aptitute (5 question each)

Round 2 - Technical 

(3 Questions)

  • Q1. Tell me about yourself?
  • Q2. Question related to projects
  • Q3. DHCP DORA process and DNS its process.
Round 3 - Behavioral 

(2 Questions)

  • Q1. What do u understand from it infrastructure? then some difficult question he asked... which i was not able to answer
  • Q2. 9 dots 4 line question along with a profit and loss question.

Interview Preparation Tips

Interview preparation tips for other job seekers - based on your mcqs you will be segregated to three different job roles namely : R&D eng, System Eng, Solution Eng, then afterwards you will be there in Managerial round.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Jun 2024. There were 3 interview rounds.

Round 1 - One-on-one 

(1 Question)

  • Q1. Experiences, Personal and Work Background
Round 2 - One-on-one 

(1 Question)

  • Q1. Background, Work Experiences, Situational Questions
Round 3 - Assignment 

Simple assignment on the task

I was interviewed before Dec 2020.

Round 1 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a 60 minute technical round involving questions based on data structures, OOPS concepts, DBMS and projects that I had mentioned in my resume.

  • Q1. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using recursion or dynamic programming.

    • Implement a recursive function to calculate the Nth Fibonacci number.

    • Use memoization to store previously calculated Fibonacci numbers for efficiency.

    • Consider using dynamic programming to optimize the solution.

    • Handle edge cases such as N = 1 or N = 2 separately.

    • Ensure the solution works efficiently for large values of N (up to 10000).

  • Answered by AI
  • Q2. Can you provide a program demonstrating operator overloading in OOP?
  • Ans. 

    Operator overloading in OOP allows custom behavior for operators like +, -, *, etc.

    • Operator overloading is a feature in OOP that allows defining custom behavior for operators

    • Example: Overloading the + operator to concatenate strings or add two numbers

    • Example: Overloading the * operator to perform matrix multiplication

  • Answered by AI
  • Q3. What is function overloading?
  • Ans. 

    Function overloading is when multiple functions have the same name but different parameters or return types.

    • Allows multiple functions with the same name but different parameters or return types

    • Helps improve code readability and maintainability

    • Example: int add(int a, int b) and float add(float a, float b)

  • Answered by AI
  • Q4. What are the differences between C and C++?
  • Ans. 

    C is a procedural programming language while C++ is a multi-paradigm programming language with object-oriented features.

    • C is a procedural programming language while C++ supports both procedural and object-oriented programming.

    • C does not support classes and objects while C++ does.

    • C does not have built-in support for exception handling while C++ does.

    • C does not have namespaces while C++ does.

    • C does not have function over

  • Answered by AI
Round 2 - HR 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

HR round that lasted for 45 minutes. Did brainstorming on puzzles and HR asked questions to know more about me.
Tips : During HR, think before you speak, they can catch any word that you speak. Prepare well for aptitude, as they shortlist less people after the test. Ask good questions during the end of the interviews. It might impress them. So prepare for it before going for the interview. Lastly, don’t be nervous, HRs are only trying to make you nervous during the interview as a part of the stress test.

  • Q1. How can you measure 45 minutes using two identical wires?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Video Call 

(5 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a 60 minute technical round where the interviewer asked programming based questions and questions on DBMS concepts.

  • Q1. 

    Maximum of All Subarrays of Size k

    Given an array of 'N' non-negative integers and an integer 'K', your task is to find the maximum elements for each subarray of size 'K'.

    Input:

    The first line contains...
  • Ans. 

    Find the maximum elements for each subarray of size 'K' in an array of non-negative integers.

    • Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

    • Pop elements from the deque if they are out of the current window of size 'K'.

    • The front of the deque will always have the index of the maximum element in the current window.

  • Answered by AI
  • Q2. Can you explain the ACID properties in the context of database management systems?
  • Ans. 

    ACID properties are a set of properties that guarantee the reliability of transactions in database management systems.

    • Atomicity ensures that either all operations in a transaction are completed successfully or none of them are. For example, transferring money from one account to another should either be completed in full or not at all.

    • Consistency ensures that the database remains in a consistent state before and after ...

  • Answered by AI
  • Q3. What is write-ahead logging in DBMS?
  • Ans. 

    Write-ahead logging is a technique used in DBMS to ensure that changes are recorded in the log before they are applied to the database.

    • Write-ahead logging ensures that changes are first written to the log file before being applied to the database to maintain data integrity.

    • It helps in recovering the database in case of a system crash or failure by replaying the log entries to bring the database back to a consistent sta...

  • Answered by AI
  • Q4. What are the deadlock avoidance schemes?
  • Ans. 

    Deadlock avoidance schemes are strategies used to prevent deadlocks in a system.

    • Banker's algorithm: Ensures that the system will never enter an unsafe state by keeping track of available resources and only granting a request if it does not lead to a deadlock.

    • Wait-die and Wound-wait: Two deadlock prevention schemes used in transaction processing systems to avoid deadlocks by allowing transactions to wait or abort based ...

  • Answered by AI
  • Q5. What is a clustered index?
  • Ans. 

    A clustered index is a type of index that sorts and stores the data rows in the table based on their key values.

    • Defines the order in which data is physically stored in a table

    • Only one clustered index per table

    • Helps in improving the performance of queries that involve range searches or sorting

    • Example: Clustered index on a table's primary key

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a 60 minute technical round where the interviewer asked data structure based questions, questions on OOPS and OS concepts.

  • Q1. What is a virtual function in C++?
  • Ans. 

    A virtual function in C++ is a function that is declared within a base class and is redefined by a derived class.

    • Virtual functions allow a function to be overridden in a derived class.

    • They are used in polymorphism to achieve runtime binding.

    • The base class function must be declared as virtual for dynamic binding to occur.

    • Example: virtual void display() = 0; // pure virtual function

  • Answered by AI
  • Q2. Can you explain the malloc() and free() operations in the context of memory management in C?
  • Ans. 

    malloc() is used to dynamically allocate memory in C, while free() is used to release allocated memory.

    • malloc() allocates a block of memory of specified size and returns a pointer to the beginning of the block.

    • free() deallocates the memory previously allocated by malloc() or calloc().

    • Example: int *ptr = (int*)malloc(5 * sizeof(int)); // Allocates memory for 5 integers

    • Example: free(ptr); // Deallocates the memory alloca

  • Answered by AI
  • Q3. What is structure padding?
  • Ans. 

    Structure padding is the concept of adding empty bytes to a structure to align its data members on memory boundaries.

    • Structure padding is done to optimize memory access and improve performance.

    • Padding is necessary because most processors require data to be aligned on specific memory boundaries for efficient access.

    • For example, if a structure contains a char followed by an int, padding may be added after the char to ali

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR based round that lasted for 30 minutes. The interviewer asked question to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Online test had 6 parts-psychometric test, aptitude, logical, English, computer skills and 2 coding questions. Time given to us was 90 minutes. Paper was quite lengthy and of average difficulty level. I was able to complete all the sections, but only one coding question.

  • Q1. 

    Reverse the String Problem Statement

    You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.

    Example:

    Input:
    STR = "abcde"
    Output:
    "e...
  • Ans. 

    Reverse a given string containing alphabets, numbers, and special characters.

    • Iterate through the string from the end to the beginning and append each character to a new string.

    • Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

    • Handle special characters and numbers while reversing the string.

    • Ensure to consider the constraints provided in the problem statement.

    • T...

  • Answered by AI
Round 2 - Face to Face 

(6 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Firstly the interviewer asked me to introduce myself after he introduced himself. Since i went there as experienced guy he asked me about my workings in the current company. After that,he asked some programming questions, tested my concepts of DBMS and OOPS, and some puzzles.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Explore neighbor nodes first before moving to the next level neighbors.

    • Consider the bidirectional nature of edges in an undirected graph.

    • Output the BFS traversal sequence for each test case in a separate line.

  • Answered by AI
  • Q2. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for efficient prime number identification

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q3. What is BCNF (Boyce-Codd Normal Form) in database management systems?
  • Ans. 

    BCNF is a normal form in database management systems that ensures all determinants are candidate keys.

    • BCNF stands for Boyce-Codd Normal Form.

    • It is a stricter version of 3NF (Third Normal Form).

    • In BCNF, every determinant must be a candidate key.

    • It helps in reducing redundancy and anomalies in the database.

    • Example: If a table has columns A, B, and C, and A determines B and B determines C, then it is not in BCNF unless A

  • Answered by AI
  • Q4. What is the difference between C and C++?
  • Ans. 

    C is a procedural programming language while C++ is an object-oriented programming language with features like classes and inheritance.

    • C is a procedural programming language, while C++ is a multi-paradigm language with support for object-oriented programming.

    • C does not support classes and objects, while C++ does.

    • C uses structures for data organization, while C++ uses classes.

    • C does not have features like inheritance an...

  • Answered by AI
  • Q5. How can you make 3 cuts to divide a round cake into 8 equal pieces?
  • Q6. How can you calculate 45 minutes using only 2 candles?
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Again 2nd round started with an introduction from both sides. Then he started asking questions from resume itself. Working in the current company and all the projects that i have done. Few simple puzzles, OOPs concepts (with proper explanation and coding) and some database related questions(questions were easy you just need to brush up the basics). Some keywords related questions from C,C++,Java(usual questions like static ,final, abstract etc.). That was the 2nd round. Then I was called for the 3rd Round. Before 3rd round they also served tasty lunch.

  • Q1. 

    Right View of Binary Tree

    Given a binary tree of integers, your task is to output the right view of the tree.

    The right view of a binary tree includes the nodes that are visible when the tree is observed...

  • Ans. 

    The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.

    • Traverse the tree level by level and keep track of the rightmost node at each level.

    • Use a queue for level order traversal and a map to store the rightmost nodes.

    • Print the values of the rightmost nodes stored in the map as the right view of the tree.

  • Answered by AI
  • Q2. You have 3 bulbs in one room and 3 switches in another room. The challenge is to determine which switch controls which bulb, with the constraint that you can only enter the bulb room once.
Round 4 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

After that he asked me what I knew about SAP and there products(Please do read all about SAP and there products-not all but at least some famous products like ERP). Then he asked me one puzzle.

  • Q1. You have 2 eggs and a building with 100 floors. What is the minimum number of attempts needed to find the highest floor from which an egg can be dropped without breaking?
Round 5 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

The round started with our Introduction to each other. After that interviewer asked me whether I do online shopping or not. I said yes then he asked me to design the online shopping portal using ER-Diagram . Then he asked me to create all the tables and populate it with data. Later on he asked me to normalize it. After all of this he asked me some simple puzzles and current salary and notice period. That was the 4th round.
After that I was asked to attend the final round and before 5th round they served snacks and tea to all of us.

  • Q1. Can you design an ER diagram for an online shopping portal?
  • Ans. 

    Yes, I can design an ER diagram for an online shopping portal.

    • Entities: User, Product, Order, Payment, Cart

    • Relationships: User places Order, Order contains Product, Payment for Order, User has Cart

    • Attributes: User (id, name, email), Product (id, name, price), Order (id, date), Payment (id, amount)

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The test had a time limit. Every 10 minutes you had to do at least 4 questions. It was quite fast paced. The questions were from basic coding, aptitude and debugging.
Tips: Learn to be fast at coding. Practice a lot of aptitude questions. Have a decent knowledge of basic coding.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of current, previous, and next nodes

    • Update the next pointer of each node to point to the previous node

  • Answered by AI
  • Q2. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character as it appears in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the substring as the window slides through the strin

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer started off by asking basic sorting questions. Followed by data structures and algorithms. And DBMS related questions in the end.
Tips: Have a good presence of mind. Understand the question asked properly. Be confident and keep discussing. Don't get nervous and solve the questions incorrectly. Have good grip over topics like sorting, DS, Algorithms and DBMS.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Next Permutation Problem Statement

    You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...

  • Ans. 

    The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.

    • Iterate from right to left to find the first element that is smaller than the element to its right.

    • Swap this element with the smallest element to its right that is greater than it.

    • Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

The round was based around my over all personality. They checked how would I be an asset to their company. They analyzed my core values and capabilities of working in a team.
Tips: Show that you are willing to work in a team. Be confident and polite. Express your feelings and passion towards your job and the company. Explain your college extra curricular activities well.

Interview Preparation Tips

Eligibility criteriaAbove 7 cgpaSAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Celigo Interview FAQs

How many rounds are there in Celigo SDE Intern interview?
Celigo interview process usually has 4 rounds. The most common rounds in the Celigo interview process are One-on-one Round, Resume Shortlist and Coding Test.
What are the top questions asked in Celigo SDE Intern interview?

Some of the top questions asked at the Celigo SDE Intern interview -

  1. Hashing basis easy question from leetc...read more
  2. Rain water trapping leetcode quest...read more
  3. Job schedule leetcode easy quest...read more

Recently Viewed

INTERVIEWS

Time Technoplast

No Interviews

DESIGNATION

INTERVIEWS

Zebra Technologies

No Interviews

INTERVIEWS

Global Autotech

No Interviews

INTERVIEWS

DE Shaw

No Interviews

SALARIES

Sun Vacuum Formers

DESIGNATION

INTERVIEWS

Billennium

No Interviews

INTERVIEWS

SAP

No Interviews

SALARIES

Nokia Networks

No Salaries

Tell us how to improve this page.

Celigo SDE Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

SAP Interview Questions
4.2
 • 309 Interviews
Innovaccer Interview Questions
3.4
 • 81 Interviews
NoBrokerHOOD Interview Questions
3.2
 • 57 Interviews
Vyapar Interview Questions
3.4
 • 53 Interviews
Classplus Interview Questions
3.4
 • 28 Interviews
Fleetx.io Interview Questions
3.7
 • 28 Interviews
Informatica Interview Questions
3.6
 • 27 Interviews
View all
Software Engineer
29 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
28 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
16 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

QA Engineer
16 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer2
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Celigo with

Zapier

2.0
Compare

Mulesoft

4.6
Compare

Talend Data Integration Services

4.0
Compare

Boomi

3.4
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent