i
BucleLabs
Filter interviews by
I am a passionate software engineer with experience in developing web applications and a strong background in computer science.
Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React
Strong background in computer science with knowledge in data structures and algorithms
Familiar with Agile development methodologies and version control systems like Git
Top trending discussions
I applied via Referral
I applied via Campus Placement
Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.
Binary Search is a search algorithm that works on sorted arrays.
It starts by comparing the target value to the middle element of the array.
If the target value is smaller, the search continues on the lower half of the array.
If the target value is larger, the search continues on the upper half of the array.
T...
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
MergeSort is a divide and conquer algorithm that sorts an array of strings.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
4 questions , 3 DSA questions medium level and 1 DB design round
I applied via Campus Placement
1 Hour 2 Medium Coding Question and few DB OOPS OS Questions on Hackerearth
I was interviewed in Nov 2023.
Questions were based on Computer Science Fundamentals, Coding and SQL
I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.
Developed a mobile app for tracking personal fitness goals
Used React Native to create a cross-platform app
Implemented features such as goal setting, progress tracking, and workout logging
Integrated with wearable devices like Fitbit for automatic data syncing
Ways to speed up SQL queries in increasing order of complexity
Use indexes on columns frequently used in WHERE clauses
Optimize queries by avoiding unnecessary joins and subqueries
Use stored procedures to reduce network traffic and improve performance
Consider denormalizing tables for frequently accessed data
Use query optimization techniques like query caching and query hints
Redis is single-threaded.
Redis is single-threaded, meaning it can only execute one command at a time.
This design choice allows Redis to be extremely fast and efficient for certain use cases.
However, it also means that Redis may not be the best choice for highly concurrent workloads.
Data types that can be used as keys in Python include strings, integers, floats, tuples, and custom objects.
Strings are commonly used as keys in Python dictionaries.
Integers and floats can also be used as keys.
Tuples can be used as keys if they only contain immutable elements.
Custom objects can be used as keys if they are hashable.
Examples: {'name': 'John'}, {1: 'apple'}, {(1, 2): 'tuple'}
Types of indexing in SQL include clustered, non-clustered, unique, and composite indexes.
Clustered index physically reorders the table based on the index key
Non-clustered index creates a separate structure for the index
Unique index ensures that all values in the index column are unique
Composite index uses multiple columns for indexing
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Front end Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
4
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior QA Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Innovaccer
Practo
Cult.fit
PharmEasy