Filter interviews by
I appeared for an interview in Jun 2024.
Caching in web APIs improves performance by storing frequently accessed data
Use in-memory caching for fast access to data
Implement output caching to store responses for future requests
Consider using distributed caching for scalability
Set appropriate cache expiration policies to ensure data freshness
One disadvantage of the repository pattern is the potential for over-abstraction and complexity.
Can lead to unnecessary complexity in simple applications
May result in additional overhead and performance issues
Difficult to implement complex queries efficiently
Can lead to code duplication if not properly managed
An anagrams program checks if two strings are anagrams of each other.
Create a function that takes in two strings as input
Remove any spaces and punctuation from the strings
Convert both strings to lowercase for case-insensitive comparison
Sort the characters in both strings
Check if the sorted strings are equal to determine if they are anagrams
I applied via LinkedIn and was interviewed in Jan 2022. There were 3 interview rounds.
I have 5 years of experience in digital banking and engagement banking as a product owner.
Developed and launched a mobile banking app with enhanced user experience
Implemented AI chatbot for customer support resulting in 30% reduction in call center traffic
Conducted market research and identified customer pain points to improve product offerings
Collaborated with cross-functional teams to prioritize and deliver product r...
Product Roadmap creation for Engagement Banking
I appeared for an interview before Jan 2021.
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
I appeared for an interview in Jun 2017.
HTML, PHP, and CSS are programming languages used for creating and designing websites.
HTML (Hypertext Markup Language) is used for creating the structure and content of web pages.
PHP (Hypertext Preprocessor) is a server-side scripting language used for creating dynamic web pages.
CSS (Cascading Style Sheets) is used for styling and formatting the layout of web pages.
Example: HTML is used to create headings, paragraphs, ...
I applied via Recruitment Consultant and was interviewed in Dec 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Apr 2023. There were 3 interview rounds.
Platform - Mettl
3 Questions of medium level difficulty to do in 2 hours, typically contain concepts like DSA, DP etc.
Structure padding is the insertion of unused bytes between structure members to align them on memory boundaries.
Padding is added to ensure that each member of a structure starts at a memory address that is a multiple of its size.
Padding is compiler-dependent and can vary between different platforms and architectures.
Padding can affect the size of a structure and the performance of the program.
Example: struct example { ...
Forming a dictionary from name
Create an empty dictionary
Iterate through each character in the name
Add the character as a key and its frequency as value in the dictionary
posted on 15 Oct 2023
1 hour for 2 coding questions on Codility Platform
based on 1 interview
Interview experience
Software Consultant
35
salaries
| ₹8 L/yr - ₹22 L/yr |
Software Engineer
27
salaries
| ₹15 L/yr - ₹23 L/yr |
Senior Software Consultant
17
salaries
| ₹13 L/yr - ₹23 L/yr |
Technical Lead
13
salaries
| ₹19.5 L/yr - ₹30 L/yr |
Application Operations Engineer
11
salaries
| ₹8.9 L/yr - ₹9.3 L/yr |
Duck Creek Technologies
FinThrive
Mobileum
AgreeYa Solutions