Filter interviews by
I applied via Referral and was interviewed in Sep 2021. There were 4 interview rounds.
SQL Joins are used to combine data from two or more tables based on a related column.
Joins are used to retrieve data from multiple tables in a single query
Types of joins include inner join, left join, right join, and full outer join
Join conditions are specified using the ON keyword and a comparison operator
Joins can be used to combine data from tables with a one-to-many or many-to-many relationship
To find errors in SQL queries, check for syntax errors, missing or incorrect table/column names, and incorrect data types.
Check for syntax errors using a SQL editor or IDE.
Verify table and column names are correct and exist in the database.
Ensure data types match between tables and queries.
Use error messages and logs to identify specific issues.
Test queries with sample data to catch errors before running on production
Different methods can be used to solve the same problem depending on the context and available resources.
Brainstorming and ideation sessions
Trial and error
Research and analysis
Collaboration and teamwork
Using established frameworks and methodologies
Leveraging technology and automation
Iterative approach to problem-solving
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
It was a combination of mcq and coding questions
mcq: aptitude + c++ + sql question, nothing really tough
Coding question: 3 leetcode question, medium level, of stack, binary search and graph traversal
Count the number of islands in a 2D grid of '1's and '0's.
Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited.
Increment the count of islands for each new island encountered.
Ensure to handle edge cases like out of bounds indices and already visited cells.
I am a detail-oriented Quality Analyst with a strong background in analyzing data and identifying areas for improvement.
Experienced in conducting quality assurance tests and creating test plans
Skilled in identifying defects and working with development teams to resolve issues
Proficient in using testing tools such as Selenium and JIRA
Strong communication skills to effectively communicate findings and recommendations
I am excited to join this Company because of its reputation for innovation, growth opportunities, and strong company culture.
The Company has a track record of innovation in the industry, which aligns with my passion for continuous improvement.
I see great potential for growth and advancement within the Company, which is important for my career development.
The Company's strong company culture, focus on employee well-bein...
Fastenal interview questions for popular designations
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
It had questions ranging from leetcode moderate to hard.
I applied via Recruitment Consulltant and was interviewed in Jul 2023. There were 3 interview rounds.
Identifying and eliminating waste of time and energy is crucial for efficiency in any process.
Identify non-value adding activities and eliminate them
Streamline processes to reduce unnecessary steps
Encourage continuous improvement to minimize waste
Implement tools like Kanban or Lean principles to reduce waste
Waste of time and energy can occur due to inefficient processes, lack of clear goals, poor communication, and unnecessary tasks.
Identify and eliminate non-value adding activities
Encourage open communication and collaboration
Set clear goals and priorities
Avoid multitasking and focus on one task at a time
I applied via Referral and was interviewed in Mar 2022. There were 3 interview rounds.
Top trending discussions
Function to return mutual friends given two ids and getFriends(id) function
Call getFriends(id) for both ids to get their respective friend lists
Iterate through both lists and compare to find mutual friends
Return the list of mutual friends
Function to return list of friends of friends in decreasing order of mutual friends
Use a set to store all friends of friends
Iterate through the list of friends of the given id
For each friend, iterate through their list of friends and count mutual friends
Sort the set of friends of friends by decreasing number of mutual friends
Given time slots, find a specific time with maximum overlap. Prove solution.
Create a list of all start and end times
Sort the list in ascending order
Iterate through the list and keep track of the number of overlaps at each time
Return the time with the maximum number of overlaps
Prove solution by testing with different input sizes and edge cases
Find the longest sub-array with increasing order of integers.
Iterate through the array and keep track of the current sub-array's start and end indices.
Update the start index whenever the current element is smaller than the previous element.
Update the end index whenever the current element is greater than or equal to the next element.
Calculate the length of the sub-array and compare it with the longest sub-array found s
Find the length of longest increasing subsequence and print the sequence from an array of integers.
Use dynamic programming to solve the problem
Create an array to store the length of longest increasing subsequence ending at each index
Traverse the array and update the length of longest increasing subsequence for each index
Print the sequence by backtracking from the index with the maximum length
Time complexity: O(n^2)
Exam...
Code to find a given integer in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle edge cases such as the target integer not being present in the array.
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the heap size exceeds K, remove the smallest element.
At the end, the heap will contain the largest K numbers in the input.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a doubly linked list to keep track of the order of items in the cache
Use a hash map to store the key-value pairs for fast access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and the hash map
based on 8 interviews
Interview experience
based on 48 reviews
Rating in categories
Software Developer
66
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Developer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
IT Technical Lead
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Grainger
WESCO International
Rexel
Wuerth