Filter interviews by
The question is asking for a solution to find the nearest element to a given element in an array.
Iterate through the array and calculate the absolute difference between each element and the given element.
Keep track of the minimum difference encountered and the corresponding element.
Return the element with the minimum difference as the nearest element.
There are 3 possible triangles that can be formed using the two lines.
To form a triangle, we need three points.
With two lines, we have a total of four points.
By choosing any three points, we can form a triangle.
Therefore, there are 3 possible triangles.
Identify the most recent duplicate in an array of strings.
Iterate through the array and keep track of the indices of each string using a hashmap.
If a string is already present in the hashmap, update its index.
After iterating through the array, find the string with the highest index in the hashmap.
The function should return the element k from a Binary Search Tree (BST).
Traverse the BST in-order and keep track of the current element
If the current element is equal to k, return it
If the current element is greater than k, move to the left subtree
If the current element is less than k, move to the right subtree
Repeat until the element is found or the entire tree is traversed
Entering gogle.com triggers DNS lookup, establishes a connection, and retrieves the website content for display.
1. DNS Lookup: The browser queries a DNS server to resolve 'gogle.com' to an IP address.
2. TCP Connection: A TCP connection is established with the server using the resolved IP address.
3. HTTP Request: The browser sends an HTTP GET request to the server for the webpage.
4. Server Response: The server proc...
There are three common methods to compress images: lossless compression, lossy compression, and resizing.
Lossless compression reduces file size without losing any image quality. Examples include PNG and GIF formats.
Lossy compression reduces file size by discarding some image data. Examples include JPEG format.
Resizing reduces file size by changing the dimensions of the image. It can be done manually or using image...
To rotate a matrix by 90 degrees clockwise, transpose the matrix and then reverse each row. To rotate anticlockwise, reverse each row and then transpose.
Transpose the matrix by swapping elements at (i, j) with (j, i)
Reverse each row of the transposed matrix
To rotate anticlockwise, reverse each row of the original matrix and then transpose
I applied via Approached by Company and was interviewed before Oct 2023. There were 3 interview rounds.
I appeared for an interview before Mar 2024, where I was asked the following questions.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To rotate a matrix by 90 degrees clockwise, transpose the matrix and then reverse each row. To rotate anticlockwise, reverse each row and then transpose.
Transpose the matrix by swapping elements at (i, j) with (j, i)
Reverse each row of the transposed matrix
To rotate anticlockwise, reverse each row of the original matrix and then transpose
There are three common methods to compress images: lossless compression, lossy compression, and resizing.
Lossless compression reduces file size without losing any image quality. Examples include PNG and GIF formats.
Lossy compression reduces file size by discarding some image data. Examples include JPEG format.
Resizing reduces file size by changing the dimensions of the image. It can be done manually or using image proc...
Identify the most recent duplicate in an array of strings.
Iterate through the array and keep track of the indices of each string using a hashmap.
If a string is already present in the hashmap, update its index.
After iterating through the array, find the string with the highest index in the hashmap.
There are 3 possible triangles that can be formed using the two lines.
To form a triangle, we need three points.
With two lines, we have a total of four points.
By choosing any three points, we can form a triangle.
Therefore, there are 3 possible triangles.
The function should return the element k from a Binary Search Tree (BST).
Traverse the BST in-order and keep track of the current element
If the current element is equal to k, return it
If the current element is greater than k, move to the left subtree
If the current element is less than k, move to the right subtree
Repeat until the element is found or the entire tree is traversed
The question is asking for a solution to find the nearest element to a given element in an array.
Iterate through the array and calculate the absolute difference between each element and the given element.
Keep track of the minimum difference encountered and the corresponding element.
Return the element with the minimum difference as the nearest element.
Entering gogle.com triggers DNS lookup, establishes a connection, and retrieves the website content for display.
1. DNS Lookup: The browser queries a DNS server to resolve 'gogle.com' to an IP address.
2. TCP Connection: A TCP connection is established with the server using the resolved IP address.
3. HTTP Request: The browser sends an HTTP GET request to the server for the webpage.
4. Server Response: The server processes...
Top trending discussions
I appeared for an interview before Sep 2021.
I applied via Campus Placement and was interviewed before Jul 2020. There were 4 interview rounds.
OOP concepts are fundamental to software engineering. They include encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: bundling data and methods that operate on that data within a single unit
Inheritance: creating new classes from existing ones, inheriting their properties and methods
Polymorphism: the ability of objects to take on many forms, allowing for flexibility and extensibility
Abstraction: hi...
I applied via Recruitment Consulltant and was interviewed before Jul 2021. There were 3 interview rounds.
Questions were not hard but time was less
I applied via Job Portal and was interviewed in Aug 2024. There were 3 interview rounds.
I think 35 mins and 60 question, no negative marking
A coding test in ruby with proper test cases
I applied via Approached by Company and was interviewed in Aug 2024. There were 3 interview rounds.
Codility platform
1 hr
Simple string manipulation - Given a string and integer k, crop the strings to fit into k length with the following conditions:
You can only crop out the whole words.
If there is cropping of words in the string, append " ..." in the end. And the overall length should be <= k
If the first word itself is longer than k, return "..."
Identify and fix bug in a buggy solution for island problem
Check for incorrect logic in identifying islands
Ensure proper handling of edge cases like boundaries
Verify the implementation of depth-first search or breadth-first search algorithm
based on 2 interview experiences
Difficulty level
Duration
based on 41 reviews
Rating in categories
Member Technical Staff
39
salaries
| ₹11.6 L/yr - ₹31 L/yr |
Escalation Engineer
19
salaries
| ₹16 L/yr - ₹29.5 L/yr |
Technical Lead
15
salaries
| ₹36.6 L/yr - ₹57.5 L/yr |
TAC Engineer
7
salaries
| ₹6 L/yr - ₹10 L/yr |
Senior Information Technology Engineer
6
salaries
| ₹16.9 L/yr - ₹24 L/yr |
US Tech Solutions
SMC Corporation
Tangoe
TekisHub Consulting Services