Filter interviews by
Coding test consisting of 2 questions. The first was based on a hash set and the second on a string topic.
I applied via Naukri.com and was interviewed before Apr 2022. There were 3 interview rounds.
It was a hacker earth test. The questions i had got was weird and the answer was something along the lines of if(num==2) return "y" else return "N"
Twitter is a social media platform that allows users to share short messages called tweets.
Twitter uses a distributed system architecture to handle high traffic and ensure scalability.
The system consists of multiple servers for different functions such as user authentication, tweet storage, and search indexing.
Twitter also uses caching and load balancing techniques to improve performance.
To handle real-time updates, Tw...
API design with filters allows users to retrieve specific data by applying filters to the API request.
Filters can be applied to different fields in the API request, such as date range, location, or category.
API design should include clear documentation on available filters and their syntax.
Filters can be combined to create more complex queries.
Examples of filter syntax include using operators such as '>', '<', '>=', '<...
Top trending discussions
posted on 10 Oct 2024
I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.
posted on 13 Dec 2024
posted on 7 Oct 2024
I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.
I was interviewed in Jan 2022.
Round duration - 90 minutes
Round difficulty - Medium
The task is to determine if a given singly linked list forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the list.
To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.
The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.
If there is a cycle, the fast pointer will eventually catch up to the slow pointer.
If the fast pointer ...
Round duration - 60 minutes
Round difficulty - Medium
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree
During the BFS traversal, keep track of the current level and increment the depth by 1 for each level
Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
The problem is to find the intersection of two sorted arrays.
Use two pointers to iterate through the arrays.
Compare the elements at the current pointers and move the pointers accordingly.
If the elements are equal, add it to the intersection array and move both pointers.
If the element in the first array is smaller, move the first pointer.
If the element in the second array is smaller, move the second pointer.
Repeat until...
What is the difference between a mutex and a semaphore
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.
Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.
Mutex has ownership, meaning the thread that locks it must unlock it.
Semaphore does not hav...
Round duration - 60 minutes
Round difficulty - Easy
It was a managerial round. The interviewer started by introducing himself and then asked for my introduction. We then had an in-depth discussion on Cloud Computing, its importance and di...
The interviewer asked about Cloud Computing, OSI layers, network security, and security protocols.
Discussed the importance of Cloud Computing
Talked about the different OSI layers
Explored the significance of network security in today's world
Discussed various security protocols in place
Had a healthy and friendly discussion
Round duration - 25 minutes
Round difficulty - Easy
The interviewer introduced himself and then asked for my introduction. He then asked me why I wanted to join F5 networks and why they should hire me. He then told me in-depth about the co...
I wanted to join F5 networks because of their strong reputation in the industry and their commitment to innovation and customer satisfaction.
I am impressed by F5 networks' track record of delivering cutting-edge solutions to their clients.
I believe my skills and experience align well with the company's goals and values.
F5 networks' focus on customer satisfaction resonates with my own commitment to providing excellent s...
Tip 1 : Practice a lot of DSA questions on various online platforms.
Tip 2 : Regularly go back to some of the typical DSA questions.
Tip 3 : Give equal importance to OS, OOPS, and CN subjects.
Tip 1 : Be thorough with your resume to answer anything and everything from your resume.
Tip 2 : Do not put false information on your resume.
posted on 4 Jan 2025
I applied via Company Website and was interviewed in Jul 2024. There was 1 interview round.
Hacker rank test, java code and system design
Aptitude test was based on real world scenario
In 50 minutes 3 questions were asked to be solved.
Difficulty from moderate to hard
I applied via Referral and was interviewed before Nov 2022. There were 6 interview rounds.
3 coding questions haker rank test
posted on 15 Oct 2024
DSA questions were asked of easy to mid
based on 6 reviews
Rating in categories
Team Lead
207
salaries
| ₹1.9 L/yr - ₹5.5 L/yr |
Senior Manager
157
salaries
| ₹10 L/yr - ₹30 L/yr |
Sales Executive
128
salaries
| ₹1.3 L/yr - ₹4.4 L/yr |
Assistant Manager
124
salaries
| ₹3 L/yr - ₹7.7 L/yr |
Zonal Manager
115
salaries
| ₹6 L/yr - ₹18 L/yr |
Paytm Payments Bank
Fino Payments Bank
India Post Payments Bank
Jio Payments Bank