Filter interviews by
The duration of this round was around 20 minutes and there were 40 questions in total. This round consisted of standard mathematical, logical aptitude questions. Aptitude questions based on directions, speed and time, profit loss, etc. were asked. Out of 40 questions, around 15 questions were diagram based questions like finding the odd one, predict the next pattern, etc.
The Second Round is an Online coding test that lasts for around 30 minutes to 1 hour. It was held on the coder byte platform. There were around 5-6 MCQs and 1 Coding Question. MCQ Questions - Predict the output, find errors, Simple language-based questions etc. The Coding Question was from Arrays, Strings, etc. For Example, You are given a string like “ONE PLUS THREE MINUS TWO” and you will have to give output as “TWO”
They will give you a frontend role based on your performance in Interviews Rounds.
Top trending discussions
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
To center a div in CSS3, use the 'margin: auto;' property along with a set width.
Set the width of the div
Use 'margin: auto;' to center the div horizontally
Make sure the parent container has a defined width
call, bind, and apply are methods used to manipulate the context of a function in JavaScript.
call() is used to invoke a function with a specified 'this' value and arguments provided individually.
bind() is used to create a new function with a specified 'this' value and initial arguments.
apply() is used to invoke a function with a specified 'this' value and arguments provided as an array.
I appeared for an interview in Aug 2021.
Round duration - 90 Minutes
Round difficulty - Easy
1 coding question which was quite easy. Some MCQ that includes basic questions related to html, css, javascript, oops, dbms and output.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and updates.
When capacity is reached, evict the least recently used item before inserting a new one.
Update the order of keys in the linked list whenever a ke
Round duration - 90 Minutes
Round difficulty - Easy
easy round. Had some frontend questions related to html ,css, js , etc Explain Closures in JavaScript. In how many ways can we specify the CSS styles for the HTML element?
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
Check if a given string is a palindrome considering only alphanumeric characters.
Remove non-alphanumeric characters from the input string.
Compare the string with its reverse to check for palindrome.
Handle edge cases like empty string or single character input.
Use two pointers approach for efficient comparison.
normalization, indexing
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Indexing is a technique to quickly retrieve data from a database.
Normalization helps in reducing data redundancy by breaking down tables into smaller, related tables.
Indexing is used to quickly retrieve data by creating indexes on columns in a table.
Normalization ensures data integrity by minimizing data dupli...
Round duration - 120 Minutes
Round difficulty - Hard
late at 8.00 pm
Given 'N' processes with their “burst times”, where the “arrival time” for all processes is ‘0’, and the ‘priority’ of each process, your task is to compute the “waiting ti...
Implement Priority CPU Scheduling algorithm to compute waiting time and turn-around time for processes.
Implement a function that takes in burst times, priorities, and number of processes as input
Sort the processes based on priority, with lower process ID as tiebreaker
Calculate waiting time and turn-around time for each process based on the scheduling algorithm
Data spooling is a process where data is temporarily stored in a buffer before being sent to an output device.
Data spooling helps in managing the flow of data between different devices by storing it temporarily.
It allows for efficient processing of data by decoupling the input/output operations.
Examples of data spooling include print spooling, where print jobs are stored in a queue before being sent to the printer.
Inheritance is a relationship between a superclass and subclass, while generalization is a relationship between entities with common characteristics.
Inheritance involves a parent-child relationship where the child class inherits attributes and methods from the parent class.
Generalization involves grouping entities with common attributes into a higher-level entity.
Inheritance is a specific form of generalization in obje...
Tip 1 : be confident
Tip 2 : make sure to talk less
Tip 3 : give precise answer
Tip 1 : mention only relevant things
Tip 2 : be precise
I appeared for an interview in Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
test timing: 7-8 pm
2 programming questions
webcam proctored
You are provided with an array ARR
of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...
Find minimum cost to reach end of array by jumping with constraints
Use dynamic programming to keep track of minimum cost at each index
Iterate through the array and update the minimum cost based on reachable indices within K steps
Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Tip 1 : Ability to apply data structures in questions(practice graph and Tree questions)
Tip 2 : Thorough knowledge of the projects done
Tip 3 : Good knowledge about computer science concepts
Tip 1 : Mention projects that you have done yourself and are thorough with
Tip 2 : mention soft skills
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Medium
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.
Convert the string to lowercase and remove all symbols and whitespaces.
Reverse the modified string and compare it with the original string.
If they are equal, then the string is a palindrome.
If not, then the string is not a palindrome.
Given a number N
, calculate its square root and output the integer part only.
18
4
The square root of 18 is approximate...
The task is to find the integral part of the square root of a given number.
Use the built-in square root function to find the square root of the number.
Convert the result to an integer by rounding down or using the floor function.
Print the integer part of the square root as the output.
Given a positive integer N
, your task is to determine the minimum number of steps required to reduce N
to 1.
1) Subtract 1 from it: n = n -...
The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.
Use dynamic programming to solve the problem efficiently.
Create an array to store the minimum steps required for each number from 1 to N.
Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.
Return the minimum steps for N.
Round duration - 60 Minutes
Round difficulty - Medium
They started Fundamentals of OOP- Inheritance, Polymorphism
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.
Initialize two variables, maxSum and currentSum, both set to the first element of the array.
Iterate through the array from the second element.
For each element, update currentSum by adding the element to it.
If currentSum becomes negative, reset it to 0.
If currentSum is greater than maxSum, update maxSum.
After iterating ...
Round duration - 30 Minutes
Round difficulty - Medium
Some people had two HR interviews but I only had one and interview went up till 11:30 pm and you get only 5-10 minutes to prepare for HR on Zoom
Tip 1 : Solve atleast 200 problems
Tip 2 : Focus on all data structures
Tip 3 : Build some good projects
Tip 1 : Keep it precise and concise.
Tip 2 : Build your resume yourself according your skills
I applied via Naukri.com and was interviewed in Feb 2020. There was 1 interview round.
I appeared for an interview in Dec 2017.
To find the maximum water pond formed between buildings.
Identify the lowest point between the buildings.
Calculate the area of the pond using the distance between the buildings and the depth of the pond.
Consider any obstacles or uneven ground that may affect the pond's shape.
Use a surveying tool or satellite imagery to get accurate measurements.
Take into account any drainage systems or natural water flow that may affect
Design a dictionary using trie with insert, update and delete operations.
Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word
For insert operation, traverse the trie and add nodes for each character in the word
For update operation, delete the existing word and insert the updated word
For delete operation, mark the end of word flag as false and delete the node if it ...
I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
Find subset of numbers in array that sum up to zero.
Use a nested loop to iterate through all possible subsets.
Calculate the sum of each subset and check if it equals zero.
Store the subset if the sum is zero.
Optimize the solution by using a hash set to store the cumulative sum of elements.
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order.
BFS starts at a given vertex and explores all its neighbors before moving to the next level of vertices.
It uses a queue data structure to keep track of the vertices to be visited.
BFS guarantees that it visits all the vertices of a connected graph.
It can be used to find the shortest path between two
In 5 years, I see myself as a highly skilled software developer, leading a team and contributing to innovative projects.
Continuously improving my technical skills through learning and hands-on experience
Taking on leadership roles and mentoring junior developers
Contributing to the development of cutting-edge software solutions
Building strong relationships with clients and stakeholders
Staying updated with the latest indu...
Some of the top questions asked at the Verifone Front end Developer interview -
Software Development Engineer
134
salaries
| ₹6.8 L/yr - ₹17 L/yr |
Software Engineer
110
salaries
| ₹5.2 L/yr - ₹17 L/yr |
Senior Software Engineer
76
salaries
| ₹8.5 L/yr - ₹24 L/yr |
Software Developer
53
salaries
| ₹5.7 L/yr - ₹14.5 L/yr |
Software Development Engineer II
52
salaries
| ₹8.4 L/yr - ₹18.1 L/yr |
Paytm
HighRadius
Broadridge Financial Solutions
PayPal