Filter interviews by
I was interviewed before Mar 2022.
It was easy to clear this round
This is basic level of coding round where we have 4 questions to solve
Easy to clear .my gd was like fish market
Advance coding round
Need to solve one coding questions
We can solve easily if we have some basic knowledge on dsa
Top trending discussions
posted on 19 Dec 2024
I applied via Campus Placement
It was good 20 mcqs 3 coding questions
Basic DSA questions, best time to buy and sell stock and its variation
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
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
2 Leetcode Medium questions on hackerrank
posted on 28 Aug 2024
25 questions , 1 hour
1 coding , 2 logical question
posted on 7 Sep 2024
I applied via LinkedIn and was interviewed in Mar 2024. There were 4 interview rounds.
First round was coding test conducted by their IDE where you can program in any language like on hackerrank IDE . 5 question were asked from easy to hard
Stack is used for static memory allocation and stores local variables, while heap is used for dynamic memory allocation and stores objects.
Stack memory is allocated in a contiguous block and is faster to access compared to heap memory.
Variables stored on the stack have limited scope and lifetime, while objects on the heap can persist beyond the scope of the function.
Stack memory is managed by the compiler, while heap m...
Compiler translates entire code into machine code before execution, while interpreter translates code line by line during execution.
Compiler translates entire code into machine code before execution
Interpreter translates code line by line during execution
Compiler generates error messages after scanning entire code
Interpreter stops at first error encountered
Examples: C, C++ use compilers; Python, Ruby use interpreters
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 1 interview
Interview experience
Customer Success Manager
106
salaries
| ₹4 L/yr - ₹10 L/yr |
Sales Development Representative
80
salaries
| ₹3 L/yr - ₹8.5 L/yr |
Product Specialist
55
salaries
| ₹3.5 L/yr - ₹7.1 L/yr |
Quality Analyst
38
salaries
| ₹4.5 L/yr - ₹10.1 L/yr |
Software Engineer
37
salaries
| ₹5.2 L/yr - ₹20 L/yr |
greytHR
sumHR - HRMS Software
Darwinbox
ZingHR