Filter interviews by
I applied via LinkedIn and was interviewed in Dec 2023. There was 1 interview round.
posted on 26 Sep 2023
I applied via Naukri.com and was interviewed in Aug 2023. There were 3 interview rounds.
Kasineni venkata Sai Mukesh
Creating a frame using Python involves using loops to print characters in a specific pattern.
Use nested loops to print characters in the desired pattern
Determine the dimensions of the frame (rows and columns)
Print characters based on the position in the loop
Create a profile using CSS and JavaScript
Use CSS to style the profile layout
Use JavaScript to add interactive elements like buttons or animations
Include a profile picture, name, bio, and contact information
Add hover effects or transitions for a polished look
Key responsibilities of Web Developers include designing, coding, and maintaining websites, as well as collaborating with clients and team members.
Designing and developing websites using programming languages such as HTML, CSS, and JavaScript
Ensuring websites are responsive and optimized for various devices
Collaborating with clients to understand their requirements and provide solutions
Testing and debugging websites to...
HTTP/2 offers several advantages over HTTP 1.1, including improved performance and efficiency.
Multiplexing: HTTP/2 allows multiple requests and responses to be sent and received at the same time over a single connection, improving efficiency.
Header compression: HTTP/2 uses HPACK compression for headers, reducing overhead and improving performance.
Server push: HTTP/2 allows servers to push resources to the client before...
ETag is an HTTP header used for web caching to determine if a resource has changed.
ETag is a unique identifier assigned to a specific version of a resource on the web server.
When a client requests a resource, the server sends the ETag along with the resource.
The client can then use the ETag in subsequent requests to check if the resource has been modified.
If the ETag matches the current version of the resource on the s...
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
based on 1 interview
Interview experience
Graphic Designer
3
salaries
| ₹3 L/yr - ₹3.6 L/yr |
TCS
Accenture
Wipro
Cognizant