Filter interviews by
Clear (1)
I applied via Walk-in and was interviewed before Mar 2023. There were 3 interview rounds.
Arrow functions are a concise way to write functions in JavaScript.
Arrow functions are introduced in ES6.
They have a shorter syntax compared to traditional function expressions.
Arrow functions do not have their own 'this' keyword.
They are best suited for non-method functions.
Example: const add = (a, b) => a + b;
Code to match parentheses in a string
Use a stack to keep track of opening parentheses
Iterate through the string and push opening parentheses onto the stack
When a closing parenthesis is encountered, pop from the stack and check if it matches the closing parenthesis
HLS stands for HTTP Live Streaming, a protocol used for streaming media over the internet.
HLS breaks the media content into small chunks and delivers them over HTTP.
It is widely used for streaming video and audio content on the internet.
HLS allows adaptive bitrate streaming, where the quality of the video adjusts based on the viewer's network speed.
Popular streaming services like Netflix and Hulu use HLS for delivering
I applied via Naukri.com and was interviewed before Jun 2020. There were 4 interview rounds.
I was interviewed in Jan 2022.
Round duration - 30 Minutes
Round difficulty - Easy
In this round, Interviewer tried to judge if my basics are clear or not.
He focused majorly on CS fundamentals.
He was pretty cooperative and gave me time after asking questions.
Yes, I have solved a complex Java problem on my own.
I once had to optimize a large-scale Java application by implementing multithreading to improve performance.
I successfully debugged a memory leak issue in a Java program by analyzing heap dumps and identifying the root cause.
I designed and implemented a custom data structure in Java to efficiently solve a specific problem.
Given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.
Since the answer can be very large, return the answer ...
The task is to find the Nth Fibonacci number using matrix exponentiation and return the answer modulo 10^9 + 7.
Implement a function to find the Nth Fibonacci number using matrix exponentiation.
Return the answer modulo 10^9 + 7 to handle large values.
Use the formula F(n) = F(n-1) + F(n-2) with initial values F(1) = F(2) = 1.
Optimize the solution to achieve better than O(N) time complexity.
Consider solving the problem us...
Given an array ARR
of size N
, perform the operation to swap the Kth element from the beginning with the Kth element from the end of the array.
N = 5, K = 2
...
Swap Kth elements in an array with given constraints.
Create a function that takes the array, K value, and size of the array as input
Swap the Kth element from the beginning with the Kth element from the end
Handle edge cases like K being out of bounds or array size being less than 2
Round duration - 30 minutes
Round difficulty - Medium
It was in late evening, interviewer was quite cool and asked me quite basic things about myself.
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...
Given constraints and rules, maximize vaccines administered on a specific day during a vaccination drive.
Iterate through each test case and calculate the maximum number of vaccines administered on the specified day.
Distribute the available vaccines evenly across the days while adhering to the rules.
Ensure that the sum of vaccines administered does not exceed the maximum allowed.
Maximize the vaccines administered on the
Tip 1 : Know your project from the core.
Tip 2 : Make your basics of CS fundamentals crystal clear.
Tip 3 : Do all must ask Dsa questions, try to achieve the goal of 5-10 questions everyday.
Tip 1 : Add your github and other problem solving sites like leetcode and codeforces on your resume. It leaves a good impact.
Tip 2 : Brief your role on the projects.
Tip 3 : Mention your achievements and skills. Again they leave a good impact.
I applied via Job Portal and was interviewed in Jun 2021. There were 5 interview rounds.
Oops concepts are fundamental to object-oriented programming. They help in creating modular and reusable code.
Encapsulation - hiding implementation details of an object from the outside world
Inheritance - creating new classes from existing ones, inheriting their properties and methods
Polymorphism - ability of objects to take on many forms, depending on the context
Abstraction - focusing on essential features of an objec
Multiple inheritance is not allowed in Java to avoid the diamond problem.
Java supports multiple interface inheritance to achieve the same functionality.
Diamond problem occurs when a class inherits from two classes with a common method.
Java prioritizes single inheritance to maintain simplicity and avoid ambiguity.
Arrays are fixed in size while ArrayLists can dynamically grow and shrink.
Arrays are of fixed size while ArrayLists can be resized dynamically.
Arrays can hold primitive data types and objects while ArrayLists can only hold objects.
Arrays are faster for accessing elements while ArrayLists are faster for adding and removing elements.
Arrays use square brackets [] to declare while ArrayLists use angle brackets <>.
Example: ...
Java collections are classes and interfaces that provide a way to store and manipulate groups of objects.
Java collections include List, Set, Map, Queue, and their respective implementations
They provide methods for adding, removing, and accessing elements
Examples include ArrayList, HashSet, TreeMap, and PriorityQueue
Time theta is a measure of the worst-case time complexity of an algorithm.
It is used to analyze the performance of algorithms.
It represents the maximum amount of time an algorithm takes to complete.
It is denoted by the symbol Θ(n).
Bubble sorting 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 is a comparison-based algorithm
It works by comparing each pair of adjacent elements and swapping them if they are in the wrong order
The algorithm repeats this process until no more swaps are needed
It has a worst-case and average-case complexity of O(n^...
Code to generate a random number between 15-25
Use Math.random() to generate a random number between 0-1
Multiply the result with the range (25-15) and add the minimum value (15)
Use Math.floor() to round down the result to an integer
It was dp and math related problem
I was interviewed in Dec 2021.
I applied via LinkedIn and was interviewed in Jul 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Mar 2023. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Senior Engineer
115
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Engineer
63
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
62
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
59
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Tata Play
Airtel DTH Services
Videocon d2h
SUNDIRECT