Filter interviews by
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Top trending discussions
I applied via Recruitment Consultant and was interviewed before Oct 2020. There were 3 interview rounds.
I appeared for an interview before Jun 2024, where I was asked the following questions.
Designing a Twitter-like platform requires scalability, user engagement, security, and diverse content management.
Scalability: Ensure the platform can handle millions of users and tweets, like Twitter's infrastructure with distributed databases.
User Engagement: Implement features like trending topics, hashtags, and notifications to keep users active and informed.
Security: Protect user data with encryption and implement...
Main programming paradigms include procedural, object-oriented, functional, and declarative programming, each with unique approaches.
Procedural Programming: Focuses on procedures or routines (e.g., C, Pascal).
Object-Oriented Programming: Uses objects to represent data and methods (e.g., Java, C++).
Functional Programming: Emphasizes functions and immutability (e.g., Haskell, Scala).
Declarative Programming: Focuses on wh...
I appeared for an interview before Mar 2021.
Round duration - 30 minutes
Round difficulty - Medium
This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.
Round duration - 60 minutes
Round difficulty - Medium
In this test round, 2 coding questions were given. Either write the code or pseudo code
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 without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate all valid configurations and print them out.
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 array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Detect if a given linked list is circular by checking if it forms a closed loop.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, the linked list is circular.
If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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 before Sep 2020. There were 3 interview rounds.
Java supports OOP concepts like encapsulation, inheritance, polymorphism, and abstraction, enhancing code reusability and maintainability.
Encapsulation: Bundling data and methods. Example: private variables with public getters/setters.
Inheritance: Deriving new classes from existing ones. Example: class Dog extends Animal.
Polymorphism: Ability to take many forms. Example: method overriding and overloading.
Abstraction: H...
Basic MySQL commands include creating databases, tables, inserting data, querying, updating, and deleting records.
CREATE DATABASE db_name; // Creates a new database
USE db_name; // Selects the database to use
CREATE TABLE table_name (column1 datatype, column2 datatype); // Creates a new table
INSERT INTO table_name (column1, column2) VALUES (value1, value2); // Inserts data into a table
SELECT * FROM table_name; // Retriev...
I appeared for an interview in Oct 2020.
Round duration - 90 minutes
Round difficulty - Easy
There were two section Aptitude and Coding.
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.
Keep track of the maximum profit after the first transaction and the maximum profit overall by considering different combinations of buy a...
Round duration - 60 minutes
Round difficulty - Easy
This was the first technical interview.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
Keep track of pairs in a hash set to avoid duplicates.
Sort the pairs based on the criteria mentioned in the question.
Return the sorted list of pairs.
Tip 1 : Prepare theory subjects well
Tip 2 : Start doing some development and learn a framework from 2nd year
Tip 1: Mention projects with technologies
Tip 2: Make important words in bold
I appeared for an interview in Apr 2021.
Interview for backend developer with experience in django
Django ORM allows developers to interact with the database using Python objects instead of SQL queries.
Use `Model.objects.all()` to retrieve all records from a model.
Filter records with `Model.objects.filter(field=value)`; e.g., `Book.objects.filter(author='John')`.
Use `Model.objects.get(pk=value)` to retrieve a single record by primary key.
Chain methods for complex queries, e.g., `Model.objects.filter(field1=value1).e...
Django's request response flow involves the request being handled by URL dispatcher, views, middleware, and templates before generating a response.
Request is received by URL dispatcher which maps the URL to a view function
View function processes the request, interacts with models if needed, and returns a response
Middleware can intercept the request and response for additional processing
Templates are used to generate HT...
I applied via Naukri.com and was interviewed in Sep 2021. There were 3 interview rounds.
posted on 19 Sep 2024
I applied via Company Website and was interviewed in Aug 2024. There were 2 interview rounds.
Very basic aptitude questions along with few coding questions
based on 1 interview experience
Difficulty level
Duration
based on 4 reviews
Rating in categories
Data Engineer
208
salaries
| ₹3 L/yr - ₹12.5 L/yr |
Engineer 1
172
salaries
| ₹4 L/yr - ₹9.1 L/yr |
L2 Engineer
142
salaries
| ₹6.2 L/yr - ₹14 L/yr |
Technical Lead
103
salaries
| ₹20.4 L/yr - ₹35 L/yr |
Associate Engineer
98
salaries
| ₹2.7 L/yr - ₹6 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Capital Numbers Infotech