i
ivy
Filter interviews by
Array related question
Find if there are three elements in an array that sum up to a given target value.
Sort the array first to make the solution more efficient.
Use two pointers technique to find the triplet sum.
Handle duplicates by skipping them while iterating.
Top trending discussions
I applied via Campus Placement
Question related to operating system and computer network
Traverse all child nodes in a tree data structure
Use depth-first or breadth-first traversal algorithms
Recursively visit each child node starting from the root node
Consider using a stack or queue data structure for traversal
Example: Traverse all nodes in a binary tree
I applied via Walk-in and was interviewed in Nov 2024. There were 5 interview rounds.
Normal online code / frontend test
Designing and building a platform similar to BookMyShow involves creating a user-friendly interface for booking tickets for various events.
Develop a user-friendly website and mobile app for users to browse and book tickets for movies, concerts, plays, etc.
Implement a secure payment gateway for users to make online transactions.
Integrate a database to store information about events, venues, tickets, and user bookings.
In...
To build a tinyurl-like service, design a system with a URL shortening algorithm, a database to store mappings, and a redirect service.
Use a hashing algorithm to generate short URLs from long URLs (e.g. MD5, SHA-256).
Store the mappings of short URLs to long URLs in a database (e.g. MySQL, Redis).
Implement a redirect service that takes a short URL, looks up the corresponding long URL in the database, and redirects the u...
posted on 9 Dec 2024
I applied via Approached by Company and was interviewed in Nov 2024. There were 2 interview rounds.
Implement tree traversal algorithm to visit each node in a tree structure
Use depth-first search (DFS) or breadth-first search (BFS) to traverse the tree
DFS can be implemented using recursion or a stack data structure
BFS can be implemented using a queue data structure
Example: Inorder traversal of a binary tree - left, root, right
Find the path in a matrix with the longest sum of elements
Start from the top-left corner of the matrix
Move only right or down in the matrix
Keep track of the sum of elements in each path
Return the path with the longest sum
posted on 8 Oct 2024
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
OOPS is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
OOPS focuses on the concept of classes and objects
Encapsulation: bundling data and methods that operate on the data within a single unit
Inheritance: allows a class to inherit properties and behavior from another class
Polymorphism: ability to present the same interface for diffe...
Comparable is an interface used for natural ordering, Comparator is an interface used for custom ordering. Abstract class can have method implementations, Interface cannot.
Comparable interface is used to define the natural ordering of objects. Example: String class implements Comparable interface for natural ordering based on alphabetical order.
Comparator interface is used to define custom ordering of objects. Example:...
Count occurrences of each character in a given string
Create an array to store the count of each character
Iterate through the string and increment the count of each character in the array
Return the array with counts for each character
Remove duplicates from an array of strings
Iterate through the array and store each element in a set to keep track of unique values
Create a new array with the unique values from the set
I applied via Walk-in and was interviewed in Nov 2024. There were 2 interview rounds.
1st round is aptitude and pesudocode
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
posted on 9 Oct 2024
posted on 5 Oct 2024
Inheritance is a mechanism in object-oriented programming where a class inherits properties and behaviors from another class.
Allows a class to inherit attributes and methods from another class
Promotes code reusability and reduces redundancy
Creates a parent-child relationship between classes
Derived class can override or extend the functionality of the base class
Types of joins in MySQL include inner join, left join, right join, and full join.
Inner join: Returns rows when there is a match in both tables.
Left join: Returns all rows from the left table and the matched rows from the right table.
Right join: Returns all rows from the right table and the matched rows from the left table.
Full join: Returns rows when there is a match in one of the tables.
Use a centralized API gateway to manage and route requests to multiple APIs efficiently.
Implement a centralized API gateway to handle incoming requests and route them to the appropriate API based on the endpoint.
Utilize API management tools like Apigee, Kong, or AWS API Gateway to manage and monitor multiple APIs.
Consider implementing a caching layer to improve performance and reduce the number of requests to external
strstr function searches for a substring within a string and returns a pointer to the first occurrence of the substring.
Used in C programming language
Syntax: char *strstr(const char *haystack, const char *needle)
Example: char *str = strstr("hello world", "world")
Interview experience
Software Engineer
855
salaries
| ₹4 L/yr - ₹16 L/yr |
Senior Software Engineer
598
salaries
| ₹8 L/yr - ₹22.5 L/yr |
System Analyst
330
salaries
| ₹12 L/yr - ₹28 L/yr |
Test Engineer
329
salaries
| ₹4 L/yr - ₹10 L/yr |
Senior Test Engineer
323
salaries
| ₹7 L/yr - ₹15 L/yr |
TCS
Infosys
Wipro
HCLTech