i
bebo
Technologies
Filter interviews by
I applied via Campus Placement and was interviewed before Jul 2022. There were 4 interview rounds.
Easy aptitude test of 20 mcq in which easy question are asked
Pillars of OOPs concepts are Abstraction, Encapsulation, Inheritance, and Polymorphism. Types of inheritance include Single, Multiple, Multilevel, and Hierarchical.
Abstraction focuses on hiding the implementation details and showing only the necessary features.
Encapsulation bundles the data and methods that operate on the data into a single unit.
Inheritance allows a class to inherit properties and behavior from another...
Top trending discussions
I appeared for an interview before Oct 2021.
A nested list is a list that contains other lists as its elements.
Nested lists can be created using square brackets and separating the elements with commas.
Elements of a nested list can be accessed using indexing and slicing.
Example: my_list = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
Accessing element 5: my_list[1][1]
A queue is a data structure that follows the First In First Out (FIFO) principle.
Elements are added to the back of the queue and removed from the front.
Example: A line of people waiting for a movie ticket.
Operations: Enqueue (add element to back), Dequeue (remove element from front), Peek (view front element)
I applied via Naukri.com and was interviewed in Dec 2020. There were 3 interview rounds.
I applied via first naukari and was interviewed before Oct 2020. There were 4 interview rounds.
To find the shortest path in a graph stored in SQL, use algorithms like Dijkstra's or A* with SQL queries for traversal.
Use Dijkstra's algorithm for weighted graphs to find the shortest path efficiently.
For unweighted graphs, consider using Breadth-First Search (BFS).
Store graph edges in a table with columns for source, destination, and weight.
Example SQL query: SELECT * FROM edges WHERE source = 'A' AND destination = ...
I appeared for an interview in Sep 2020.
I appeared for an interview in Sep 2019.
I appeared for an interview before Nov 2020.
posted on 13 Oct 2021
I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Nov 2021. There was 1 interview round.
Level order traversal is a tree traversal algorithm that visits nodes level by level.
Start at the root node and visit all nodes at the current level before moving to the next level
Use a queue to keep track of nodes at each level
Enqueue the root node, then dequeue and visit each node while enqueueing its children
Repeat until the queue is empty
Time complexity: O(n), space complexity: O(w) where w is the maximum width of ...
based on 1 interview experience
Difficulty level
Duration
based on 1 review
Rating in categories
Software Engineer
212
salaries
| ₹4 L/yr - ₹7.8 L/yr |
Senior Software Engineer
188
salaries
| ₹5.5 L/yr - ₹13.2 L/yr |
Module Lead
43
salaries
| ₹10.7 L/yr - ₹18 L/yr |
Principal Software Engineer
34
salaries
| ₹10.2 L/yr - ₹17.7 L/yr |
Associate Software Engineer
28
salaries
| ₹3.4 L/yr - ₹5 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant