Filter interviews by
Clear (1)
Top trending discussions
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
I applied via Approached by Company and was interviewed before Jul 2021. There were 2 interview rounds.
They given 2 program to to 1-2 hour
I applied via Naukri.com and was interviewed before May 2020. There were 4 interview rounds.
Leaves of a tree are the nodes with no children in a tree data structure.
Traverse the tree and identify nodes with no children.
Use depth-first search or breadth-first search algorithms to find leaves.
Examples: In a binary tree, leaves are nodes with no left or right child.
In a general tree, leaves are nodes with no children in their child list.
The Lowest Common Ancestor (LCA) of a tree is the shared ancestor of two nodes farthest from the root.
Start from the root and traverse the tree to find the paths from the root to the two nodes.
Compare the paths to find the last common node between them, which is the LCA.
If one of the nodes is an ancestor of the other, then the ancestor node is the LCA.
I have worked on projects involving web development, mobile app development, and data analysis.
Developed a web application using React and Node.js for a client in the e-commerce industry
Created a mobile app using Flutter for a startup in the healthcare sector
Performed data analysis on customer behavior using Python and SQL for a marketing company
I completed internships at ABC Company and XYZ Company during my undergraduate studies.
Interned at ABC Company working on web development projects
Interned at XYZ Company assisting with software testing and quality assurance
Gained hands-on experience in coding, debugging, and problem-solving
Interviewed with team members and discussed coding standards and linters
Given a take-home assignment and built a card game
posted on 28 Jun 2024
I applied via Approached by Company and was interviewed before Jun 2023. There was 1 interview round.
Normal and simple js dsa question regarding strings and arrays.
posted on 25 Jun 2021
LCM of n numbers in an array
Find the GCD of all numbers in the array
Divide each number by the GCD and multiply them
Use Euclidean algorithm to find GCD
Senior Software Engineer
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer III
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Client Support Specialist
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Foundit
Timesjobs.com
Indeed
Glassdoor