i
myGate
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2023. There were 4 interview rounds.
1 coding ques nearly 90 min time
I applied via Referral and was interviewed in Apr 2022. There were 3 interview rounds.
HackerEarth question. You need to score 50/100 to qualify for the next round. The question was medium level and the topic was array and strings.
Redis is an open-source, in-memory data structure store, used as a database, cache, and message broker.
Redis is a NoSQL database that stores data in key-value pairs.
It is often used as a cache to improve the performance of web applications.
Redis can also be used as a message broker for real-time applications.
It supports a wide range of data structures, including strings, hashes, lists, sets, and sorted sets.
Redis is of...
Top trending discussions
I was interviewed in Dec 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was a technical interview round with questions on DSA, OOPS and Low Level design.
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...
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.
Polym...
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 perf...
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.
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.
I applied via Naukri.com and was interviewed in Dec 2021. There was 1 interview round.
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 enabl...
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...
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.
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
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...
I applied via Referral and was interviewed before Jul 2021. There were 2 interview rounds.
I applied via Walk-in and was interviewed in Jun 2021. There were 3 interview rounds.
Effective communication is the most important skill to perform sales.
Effective communication helps build rapport with customers and understand their needs.
It allows salespeople to articulate the value proposition of their product or service.
Active listening and empathy are crucial in sales to address customer concerns.
Negotiation and persuasion skills are also essential in closing deals.
Examples: A salesperson who can ...
I applied via Indeed and was interviewed in Jun 2021. There were 4 interview rounds.
I was interviewed before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
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.
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.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Dec 2020. There was 1 interview round.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Business Development Manager
424
salaries
| ₹0 L/yr - ₹0 L/yr |
Client Account Manager
197
salaries
| ₹0 L/yr - ₹0 L/yr |
Brand Manager
90
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Development Manager
50
salaries
| ₹0 L/yr - ₹0 L/yr |
ApnaComplex
NoBroker
CommonFloor
Nestaway