Filter interviews by
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
Program to add two numbers in sequence
Declare two integer variables to store the numbers
Take input from user for both variables
Add the two variables and store the result in a third variable
Print the result
Directives are instructions given to the compiler to perform specific tasks.
Directives are used in programming languages like C, C++, and Java.
They are used to provide instructions to the compiler.
Examples of directives include #include, #define, and #ifdef.
I applied via Job Portal and was interviewed in Sep 2022. There were 3 interview rounds.
Easy java coding questions with dp
Java mcqs are given answer them
Coding test was good difficulty was easy to medium.
posted on 27 Aug 2023
I applied via Naukri.com
The written test involved qiestions from bssic aptitude, computer fundamentals and coding.
I applied via Campus Placement and was interviewed before Jun 2022. There were 3 interview rounds.
Stocks, profit and loss, percentage, work, speed and time
I have worked on various projects including web development, mobile app development, and data analysis.
Developed a responsive e-commerce website using HTML, CSS, and JavaScript
Created a mobile app for tracking fitness goals using React Native
Performed data analysis on customer behavior using Python and SQL
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
I applied via Naukri.com and was interviewed before Oct 2019. There were 3 interview rounds.
I applied via Referral and was interviewed before Oct 2019. There was 1 interview round.
Senior Software Engineer
165
salaries
| ₹0 L/yr - ₹0 L/yr |
IP Analyst
158
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
157
salaries
| ₹0 L/yr - ₹0 L/yr |
Research Analyst
144
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Content Analyst
131
salaries
| ₹0 L/yr - ₹0 L/yr |
Thomson Reuters
Elsevier
Wolters Kluwer
Springer Nature in India