Filter interviews by
Clear (1)
2 DSA questions 1- in the frist question you have to print the length of maximum increasing sub array 2-in was related to stack, the question was to multiply string inside paranthesis for example if the input is "3(ab)" the output will be "ababab"
I applied via Campus Placement and was interviewed before Nov 2023. There were 3 interview rounds.
Event loop in JS manages asynchronous operations by executing callback functions in a queue.
Event loop is responsible for handling asynchronous operations in JavaScript.
It allows non-blocking I/O operations by executing callback functions in a queue.
Event loop continuously checks the call stack and the callback queue to prioritize tasks.
There are two types of JS modules: CommonJS and ES6 modules.
CommonJS modules use 'require' and 'module.exports' to import and export modules.
ES6 modules use 'import' and 'export' statements to import and export modules.
ES6 modules are statically analyzable, while CommonJS modules are dynamically loaded at runtime.
Use the sort() method in JavaScript to sort an array of strings.
Use the sort() method with a compare function to sort the array alphabetically.
For example, array.sort((a, b) => a.localeCompare(b)); will sort the array in ascending order.
To sort the array in descending order, you can use array.sort((a, b) => b.localeCompare(a));
Event bubbling is the process where an event triggered on a child element is propagated up to its parent elements.
Events triggered on child elements will also trigger the same event on parent elements
Event bubbling allows for delegation of event handling to a parent element
Can be controlled using event.stopPropagation() method
JS is a scripting language that allows for dynamic content on websites.
JS is a client-side scripting language used to create interactive web pages.
It can manipulate HTML and CSS to dynamically update content without reloading the page.
JS can handle events like button clicks, form submissions, and mouse movements.
It can also make asynchronous requests to fetch data from servers using AJAX.
JS code is executed by the brow...
Use the reverse() method to reverse an array in JavaScript.
Use the reverse() method on the array to reverse its elements in place.
Example: const arr = ['apple', 'banana', 'cherry']; arr.reverse(); // ['cherry', 'banana', 'apple']
Top trending discussions
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
Solid principles are a set of design principles for writing maintainable and scalable code in C#.
Single Responsibility Principle (SRP) - a class should have only one reason to change
Open/Closed Principle (OCP) - a class should be open for extension but closed for modification
Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes
Interface Segregation Principle (ISP) - client...
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 Company Website and was interviewed in Oct 2018. There was 0 interview round.
based on 2 interviews
Interview experience
Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Quality Analyst
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior HR Executive
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Front end Developer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Accenture
Wipro
Cognizant