Filter interviews by
Improving API performance involves optimizing code, reducing network latency, caching data, and scaling infrastructure.
Optimize code by reducing unnecessary database queries and improving algorithm efficiency
Reduce network latency by using CDN, optimizing server response time, and minimizing data transfer
Implement caching mechanisms to store frequently accessed data and reduce database load
Scale infrastructure by using...
JPA is a Java specification for mapping Java objects to relational databases. Spring Boot provides easy integration with JPA for data persistence.
Spring Boot provides built-in support for JPA through Spring Data JPA
Entities in JPA are annotated with @Entity to map to database tables
Repositories in Spring Data JPA are interfaces that extend JpaRepository for CRUD operations
Configuration for JPA can be done in applicatio
I applied via Recruitment Consulltant and was interviewed before May 2023. There were 2 interview rounds.
String manipulation : basic string manipulation to check your knowledge in python
posted on 2 Apr 2024
I applied via LinkedIn and was interviewed before Apr 2023. There were 5 interview rounds.
Discussion of the assignment
Top trending discussions
I applied via Referral
Swap kth and kth to last element of a singly linked list in one pass without knowing the length of the list.
Traverse the linked list using two pointers, one starting from the head and the other starting from kth node.
When the second pointer reaches the end of the list, the first pointer will be pointing to the kth to last node.
Swap the values of kth and kth to last node.
Handle edge cases such as k being out of bounds o...
Program to reverse the ordering of words in a sentence
Split the sentence into an array of words
Reverse the array
Join the array into a sentence
Program to find intersection point of two singly linked lists in O(n)
Traverse both lists and find their lengths
Move the head of the longer list by the difference in lengths
Traverse both lists in parallel until intersection point is found
Return the intersection point
Program to reverse a singly linked list both recursively and iteratively
Iteratively: Use three pointers to reverse the links between nodes
Recursively: Use a recursive function to reverse the links between nodes
In both approaches, update the head and tail pointers accordingly
Find odd weight ball among 12 identical balls using a balance in minimum weighings.
Divide balls into 3 groups of 4 each
Weigh any 2 groups against each other
If both groups weigh the same, the odd ball is in the third group
If one group is heavier, weigh any 2 balls from that group against each other
If they weigh the same, the odd ball is the remaining one
If one ball is heavier, it is the odd ball
Repeat the process with t
A program to reverse a singly linked list in groups of k using recursion.
Create a recursive function that takes the head of the linked list and the group size as parameters.
If the remaining list has less than k nodes, return the head as it is.
Reverse the first k nodes by recursively calling the function for the next group.
Connect the reversed group to the remaining list.
Return the new head of the reversed list.
Program to find length of longest substring without repeating characters in a string.
Use a sliding window approach to traverse the string
Use a hash set to keep track of unique characters in the current substring
Update the length of longest substring without repeating characters as you traverse the string
Representing date of a month using two cubes with numbers 0-9 on each face
Assign numbers 0-9 on each face of both cubes
Use one cube to represent tens digit and other for ones digit
Rotate cubes to display desired date
Example: Cube 1 - 0, 1, 2, 3, 4, 5; Cube 2 - 0, 1, 2, 6, 7, 8; To represent 23, Cube 1 shows 2 and Cube 2 shows 3
Find the character repeated most number of times in an array of strings.
Create a dictionary to store character count
Iterate through each string and character
Return the character with highest count
Answering a question on tracing output of C/C++ code snippet with pointers and references
Understand the code and identify all pointers and references
Trace the values of each pointer and reference at each step
Follow the flow of the code to determine the final output
Segmentation fault is a type of error that occurs when a program tries to access a memory location that it is not allowed to access.
Segmentation fault is also known as a segfault.
It is a common error in C and C++ programming languages.
It occurs when a program tries to read or write to a memory location that it does not have permission to access.
This can happen when a program tries to access an uninitialized pointer or ...
BFS and DFS are graph traversal algorithms used to search for nodes in a graph.
BFS stands for Breadth First Search and explores all the nodes at the current depth before moving to the next level.
DFS stands for Depth First Search and explores as far as possible along each branch before backtracking.
BFS uses a queue data structure while DFS uses a stack or recursion.
BFS is useful for finding the shortest path in an unwei...
I would prefer Depth First Search (DFS) traversal for finding a cycle in a graph.
DFS is better suited for finding cycles in a graph as it explores deeper into the graph before backtracking.
DFS can detect a cycle in a graph in O(V+E) time complexity.
DFS can be implemented using recursion or a stack.
Breadth First Search (BFS) can also be used to find cycles but it is less efficient than DFS.
In DFS, we can keep track of v
Hashmap has constant time complexity for insertion, deletion, and retrieval, but requires additional space.
Hashmap provides constant time complexity O(1) for insertion, deletion, and retrieval operations on average.
The space complexity of a hashmap is proportional to the number of elements stored in it.
Hashmap uses a hash function to map keys to indices in an underlying array, which allows for efficient lookup.
In case ...
The data structure behind a login page should store user credentials securely.
Use a database to store user information
Hash and salt passwords for security
Include fields for username, email, password, and possibly additional information
Consider implementing two-factor authentication
Using Applied Electronics to prevent train accidents in IRCTC
Implement sensors to detect obstacles on tracks
Use GPS and communication systems to alert train drivers of potential dangers
Install automatic braking systems in case of emergency
Regular maintenance and inspection of tracks and trains
Train and educate staff on safety protocols and emergency procedures
IC 555 timer is a versatile timer IC used in various applications like oscillators, timers, and flip-flops.
IC 555 timer has three modes of operation: monostable, astable, and bistable.
In monostable mode, the output is high for a fixed duration when triggered.
In astable mode, the output oscillates between high and low states.
In bistable mode, the output remains in either high or low state until triggered.
IC 555 timer ca...
The internet is a global network of interconnected devices that communicate using standardized protocols.
The internet is based on the TCP/IP protocol suite.
Data is transmitted in packets across the network.
The network model consists of layers, including the physical, data link, network, transport, and application layers.
Routing protocols are used to direct packets to their destination.
Examples of internet applications ...
I am a software engineer with experience in developing web and mobile applications using various programming languages and frameworks.
Proficient in Java, Python, and JavaScript
Experience with React, Angular, and Node.js
Strong understanding of database management systems
Passionate about learning new technologies and solving complex problems
Garbage collection is necessary to free up memory occupied by unused objects. Java uses automatic garbage collection.
Garbage collection helps prevent memory leaks and improves performance.
Java uses a mark-and-sweep algorithm to identify and remove unused objects.
The JVM periodically checks for unused objects and frees up memory occupied by them.
Developers can also manually trigger garbage collection using System.gc() m...
TCP is a connection-oriented protocol while UDP is connectionless.
TCP provides reliable data transfer while UDP does not guarantee reliability.
TCP uses flow control and congestion control while UDP does not.
TCP is slower than UDP due to the overhead of establishing and maintaining a connection.
UDP is faster than TCP for applications that can tolerate data loss such as video streaming or online gaming.
UDP is used in scenarios where speed is more important than reliability, such as online gaming and video streaming.
UDP is a connectionless protocol that does not guarantee delivery of packets
It is faster than TCP because it does not have to establish a connection before sending data
UDP is commonly used in online gaming, video streaming, and VoIP applications
It is also used for broadcasting and multicasting data to mult
The probability that three ants running on the edges of an equilateral triangle will never meet is 1/3.
The ants will never meet if they all move in the same direction (clockwise or counterclockwise) at the same speed.
The probability of this happening is 1/3, as each ant has two possible directions to choose from.
Example: If one ant starts moving clockwise, the other two ants must also move clockwise to never meet.
I am a software developer with experience in Java and Python.
I have a Bachelor's degree in Computer Science.
I have worked on various projects involving web development and data analysis.
I am proficient in Java and Python programming languages.
I am a quick learner and enjoy working in a team environment.
In 5 years, I see myself as a senior software developer leading a team of developers to create innovative solutions.
Leading a team of developers
Creating innovative solutions
Continuing to learn and grow as a developer
Contributing to the success of the company
Building strong relationships with colleagues and clients
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Bubble sort has a worst-case and average complexity of O(n^2), where n is the number of items being sorted.
It is not efficient for large lists and is generally used for educational purposes.
Example: Sorting an array of strings in alphabetical order using bubble sort.
Auto and static are two storage classes in C. Auto variables are local to a function while static variables retain their value between function calls.
Auto variables are created when a function is called and destroyed when the function ends
Static variables are initialized only once and retain their value between function calls
Auto variables have garbage value if not initialized while static variables are initialized to
My strengths include problem-solving, attention to detail, and adaptability. My weaknesses include public speaking and impatience.
Strengths: problem-solving, attention to detail, adaptability
Weaknesses: public speaking, impatience
In 5 years, I see myself as a senior software developer leading a team of developers to create innovative solutions.
Leading a team of developers to create innovative solutions
Continuing to learn and stay up-to-date with the latest technologies
Contributing to the growth and success of the company
Mentoring and coaching junior developers
Taking on more responsibilities and challenges
I am interested in exploring new technologies and learning new programming languages.
Exploring new technologies
Learning new programming languages
Attending tech conferences and meetups
Contributing to open source projects
Yes, I am open to relocation for the right opportunity.
I am willing to relocate for the right job opportunity
I am open to exploring new cities and cultures
I am willing to consider relocation assistance
I am excited about the prospect of working in a new environment
I applied via Approached by Company and was interviewed before May 2021. There were 3 interview rounds.
Mathematical thinking Analytical Thinking
based on 3 interviews
Interview experience
based on 54 reviews
Rating in categories
Senior Software Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
18
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Akamai Technologies
Limelight Networks
Cloudflare
StackPath