i
Filter interviews by
I was interviewed before Aug 2022.
Top trending discussions
posted on 17 Jul 2023
I applied via Campus Placement and was interviewed before Jul 2022. There were 4 interview rounds.
Medium level coding questions were asked
Breadth First Search is a graph traversal algorithm that explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
Start by visiting the root node and then visit all the neighbor nodes at the present depth level before moving on to the nodes at the next depth level.
Use a queue data structure to keep track of the nodes to be visited.
Mark each node as visited to avoid re...
Depth First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
Start at a node and explore as far as possible along each branch before backtracking
Use a stack to keep track of nodes to visit
Mark visited nodes to avoid revisiting them
Can be implemented recursively or iteratively
Inorder traversal of a binary tree involves visiting the left subtree, then the root, and finally the right subtree.
Start at the root node
Recursively traverse the left subtree
Visit the current node
Recursively traverse the right subtree
Repeat until all nodes are visited
Swap alternative nodes of a linked list
Iterate through the linked list and swap the data of alternate nodes
Use temporary variables to store data during swapping
Ensure to handle cases where the linked list has an odd number of nodes
Reverse a linked list by changing the next pointers of each node
Start with three pointers: current, prev, and next
Iterate through the linked list, updating the next pointer of each node to point to the previous node
Update prev, current, and next pointers for each iteration
Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
I applied via Referral
Java internals, coding questions 2sum
Developed a web-based project management tool for tracking tasks and deadlines.
Used React.js for front-end development
Implemented RESTful APIs for backend using Node.js and Express
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
Open to relocation for the right opportunity
Willing to relocate for the right job opportunity
Flexible with location for the right role
Open to considering different locations for the right position
Please inquire about the fundamentals of computer science, including object-oriented programming, data structures and algorithms, database management systems, and computer networks.
posted on 6 Oct 2024
DSA, SQL, Problem Solving, Technical, Data Structures and Algorithms
SQL query to retrieve data from a database
Use SELECT statement to specify the columns to retrieve
Use FROM clause to specify the table to retrieve data from
Use WHERE clause to filter the results based on conditions
Program to sort an array of integers in ascending order
Use a sorting algorithm like bubble sort, selection sort, or insertion sort
Iterate through the array and compare adjacent elements to swap if necessary
Repeat the process until the array is sorted
posted on 24 Nov 2024
Move negative elements to right side of array
Iterate through the array and swap negative elements to the right side
Use two pointers approach to keep track of positive and negative elements
Maintain the order of elements while moving negatives to the right side
posted on 28 Aug 2024
25 questions , 1 hour
1 coding , 2 logical question
posted on 6 Aug 2024
I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.
Coding is important three problems and mcqs of java and testing
posted on 20 Jul 2024
I applied via Naukri.com and was interviewed in Jun 2024. There were 4 interview rounds.
Number series , probablity , relations
String, pattern and one prime number questions
A bit is the smallest unit of data in computing, while a byte is made up of 8 bits.
A bit can have a value of 0 or 1, representing off or on respectively.
A byte is made up of 8 bits, allowing for a larger range of values (0-255).
Bytes are commonly used to represent characters in text, with each character typically taking up one byte.
Bits are often used in Boolean logic operations and for representing binary numbers.
Medium to hard questions based on arrays, dp
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divides array into smaller sub-arrays based on a pivot element
Recursively sorts sub-arrays
Combines sorted sub-arrays to get final sorted array
Time complexity: O(n log n) on average, O(n^2) worst case
Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Rotate a matrix by 90 degrees in place
Transpose the matrix
Reverse each row of the transposed matrix
based on 3 reviews
Rating in categories
Lead Engineer
40
salaries
| ₹10.2 L/yr - ₹25.3 L/yr |
System Engineer
39
salaries
| ₹4.4 L/yr - ₹16 L/yr |
Senior Systems Engineer
29
salaries
| ₹6.7 L/yr - ₹16 L/yr |
Software Engineer
29
salaries
| ₹4 L/yr - ₹12.5 L/yr |
Senior Engineer
25
salaries
| ₹8 L/yr - ₹19 L/yr |
Tech Mahindra
TCS
Infosys
Wipro