Filter interviews by
Be the first one to contribute and help others!
I was interviewed before Oct 2020.
Round duration - 60 minutes
Round difficulty - Easy
Questions related to Quant and Verbal.
Coding questions checked whether the basics are clear or not.
Given an integer N
, determine whether its binary representation is a palindrome.
The first line contains an integer 'T' representing the number of test cases.
The next 'T'...
Check if the binary representation of a given integer is a palindrome.
Convert the integer to binary representation.
Check if the binary representation is a palindrome by comparing it with its reverse.
Return true if it is a palindrome, false otherwise.
Tip 1 : Prepare for Aptitude Questions well since most companies have aptitude questions in the screening round. So you can proceed with further rounds only when you are well versed with Aptitude
Tip 2 : Be good with at least one programming language. Does not matter which language it is. It can be Java, C, C++, Python or any other language. Most of the coding rounds will be on websites which support multiple programming languages. Java and C are the languages which will be supported everywhere.
Tip 3 : Be prepared with at least the basics of various subjects. For CS students, these subjects could be Operating System, OOPS, Data Structures and Algorithms. Most of the interviewers will check if your basics are clear. Advanced topics are required only for few companies.
Tip 4 : If you don't know the answer to a particular question, then be honest and let me know that you are not aware of that topic instead of making something up. Most of the interviewers have 10+ years of experience and they can easily make out if you know a topic or are just making something up.
Tip 5 : If you have completed an internship, then probably your interview would be about your experience and the projects done at the internship. Be sure to state your experience and your contributions clearly.
Tip 6 : Projects are an important topic for the interview. Before the interviews, revise the projects you had completed or are working on currently. The projects need not be some external projects. These can be academic and final year projects. Make sure you know everything about the project.
Tip 1 : For freshers, always put the Education section before the Experience/Internship section and mention the educational details in reverse chronological order starting with the most recent college/university. No need to mention SSC and HSC. If you are an undergrad student, only mention the undergrad college.
Tip 2 : Always showcase 2-3 projects. The first being the final year project (could be in-progress at the time of the interview) and others can be academic profile.
Tip 3 : Mention your LinkedIn Profile, GitHub profile (For CS students), your blog URL (if you have one) and other portfolio links (relevant to your course of study)
Tip 4 : Skip the objective section. This section is usually not required since you are directly applying for that specific company.
Tip 5 : ALWAYS PROOFREAD YOUR RESUME. Make sure that your resume does not contain any spelling or grammatical errors.
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
Given an array A
containing 'N' integers and an integer m
, rearrange the elements of the array such that the differences between the array elements and m
are sor...
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
N = 4
1
232
34545
4567654
The pat...
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with 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 Company Website and was interviewed in Mar 2021. There were 2 interview rounds.
I applied via Job Portal and was interviewed before Oct 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Feb 2021. There was 1 interview round.
I applied via Referral and was interviewed before Feb 2021. There was 1 interview round.
I applied via LinkedIn and was interviewed in Jul 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Oct 2019. There were 5 interview rounds.
Find sum of k smallest numbers in a BST.
Traverse the BST in-order and add the k smallest numbers to a sum variable.
Use a priority queue to keep track of the k smallest numbers.
If k is greater than the number of nodes in the BST, return the sum of all nodes.
If k is 0, return 0.
Design algorithm and database for seat booking system of BookMyShow and handle failed payments.
Create a database with tables for movies, theaters, seats, bookings, and payments
Use a locking mechanism to prevent double booking of seats
If payment fails, release the locked seats and notify the user
Write a query to get the timestamp in SQL: SELECT CURRENT_TIMESTAMP;
Code for time stamp in C
Use the time.h header file
Call the time() function to get the current time in seconds
Convert the time to a string using strftime() function
Use the format string to specify the desired format of the time stamp
Rearrange array in consecutive pair multiplication in descending order.
Create a new array to store the multiplied values
Use a loop to iterate through the original array and multiply consecutive pairs
Write a compare function to sort the new array in descending order
Code to rearrange an array in maximum-minimum form.
Sort the array in descending order.
Create a new array and alternate between adding the maximum and minimum values from the sorted array.
Return the new array.
Time complexity: O(nlogn)
Space complexity: O(n)
stoi() function converts a string to an integer.
stoi() is a C++ function that takes a string as input and returns an integer.
It is used to convert a string of digits into an integer.
It can also handle negative numbers and ignore leading whitespace.
Example: int num = stoi("123"); // num is now 123
Code for finding the longest common substring in an array of strings.
Iterate through the first string and check for all possible substrings
Check if the substring is present in all other strings
Keep track of the longest common substring found so far
Return the longest common substring
Answers to common technical questions in a software engineering interview
A transaction in DBMS is a sequence of operations that must be treated as a single unit of work. ACID properties ensure reliability and consistency of transactions.
A thread is a lightweight process that shares memory and resources with other threads in the same process. A process is a separate instance of a program.
Common Linux commands include ls...
based on 25 reviews
Rating in categories
SEO Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive Accountant
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Accounts Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Accounts Executive
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Rediff.com
Info Edge
Jagran Prakashan
HT Media