NoBroker
Neo Tangent Interview Questions and Answers
Q1. Vertical Order Traversal of a Binary Tree
Given a binary tree, your task is to return the vertical order traversal of its nodes' values.
For each node located at a position (X, Y), its left child will be at (X-...read more
Vertical order traversal of a binary tree is required to be implemented for given input format and constraints.
Implement a function to perform vertical order traversal of a binary tree
Maintain the order of nodes based on their positions (X, Y)
Handle cases where two nodes have the same position by considering the left node first
Follow the input and output format as specified in the question
Java is considered an Object Oriented Programming Language because it supports the key principles of OOP such as encapsulation, inheritance, and polymorphism.
Java allows for the creation of classes and objects, which are the building blocks of OOP.
It supports encapsulation by allowing data hiding within classes.
Inheritance is supported in Java, allowing classes to inherit attributes and methods from other classes.
Polymorphism is achieved through method overloading and overrid...read more
Q3. What is OOPs concept. Why is java called an Object Oriented Programming Language. What benefit does java have as an OOP language?
OOPs stands for Object Oriented Programming. Java is called an OOP language because it follows the principles of OOP.
OOPs is a programming paradigm that focuses on objects and their interactions.
Java supports the four main principles of OOP: encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation allows bundling of data and methods into a single unit, providing data hiding and security.
Inheritance enables the creation of new classes by inheriting properties an...read more
Indexing and partitioning are techniques used in DBMS to improve performance by organizing data efficiently.
Indexing involves creating an index on a column in a database table to speed up data retrieval. It works like an index in a book, allowing the database to quickly locate the desired data.
Partitioning involves dividing a large table into smaller, more manageable parts called partitions. This can improve query performance by reducing the amount of data that needs to be sc...read more
Q5. Design the table diagram and the ways different tables will be linked for a movie booking website like bookmyshow.
Design table diagram and link tables for a movie booking website like bookmyshow.
Create tables for movies, theaters, users, bookings, payments, and reviews
Link movies and theaters through a many-to-many relationship
Link users and bookings through a one-to-many relationship
Link bookings and payments through a one-to-one relationship
Link movies and reviews through a one-to-many relationship
Q6. What is indexing and partioning in dbms?
Indexing and partitioning are techniques used in DBMS to improve performance and manage large amounts of data.
Indexing is the process of creating a data structure that allows for faster retrieval of data based on certain columns or fields.
Partitioning involves dividing a large table into smaller, more manageable parts called partitions, which can be stored on different disks or servers.
Both techniques can improve query performance, reduce storage costs, and make it easier to ...read more
Q7. Low Level Design: Design a movie site booking portal using objects and classes.
Design a movie booking portal using objects and classes.
Create a Movie class with attributes like title, genre, duration, etc.
Create a Theater class with attributes like name, location, capacity, etc.
Create a Show class with attributes like movie, theater, showtime, price, etc.
Create a Booking class with attributes like show, seats, user, etc.
Implement methods for booking tickets, canceling tickets, etc.
Use database to store movie, theater, show, and booking information.
Q8. Print vertical level traversal in a binary tree.
Print the vertical level traversal of a binary tree.
Traverse the tree and assign horizontal distance to each node.
Store nodes in a map with their horizontal distance as key.
Print nodes in each horizontal distance in vertical order.
Top Backend Developer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month