Filter interviews by
Top trending discussions
I was interviewed in Sep 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a string A
consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A
.
The main idea behind this approach is to use recursion. The idea is to compare the first character of the string A[i..j] with its last character. There are two possibilities:
Given two strings S
and T
, determine if S
follows the same pattern as T
.
A full match means there is a bijection between a letter of T
and a non-empty word of S
.
We will use two hashmaps ‘charToWord’ and ‘wordToChar’ to track which character of ‘T’ maps to which word of ‘S’ and which word of ‘S’ maps to which character of ‘T’, respectively.
Here is the algorithm:
Round duration - 40 Minutes
Round difficulty - Easy
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...
In a set of linked ninja villages, the goal is to determine if a stronger ninja exists in the nearest village linked ahead. Given a linked list of 'N' in...
We will iterate through the given linked list of elements (nodes) with the help of two nested loops. Where we will check for every node whether there exists a next node with a value bigger than the value of current node and subsequently build the ‘ans’ list (array) and return it.
The algorithm will be-
Round duration - 15 Minutes
Round difficulty - Easy
Tip 1 : Be consistent, practice regularly whatever you read/study.
Tip 2 : Apply what you learn through code.
Tip 1 : Have some projects on your resume.
Tip 2 : If you have an internship or training explain it in a proper way like what are the techniques you learned during your training.
posted on 1 Oct 2024
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
It will be a basic maths questions.
As a general topic of trend in world.
To be known for programming knowledge about us.
Java 1.8 introduced several new features including lambda expressions, functional interfaces, streams, and default methods.
Lambda expressions allow you to write code in a more concise and readable way.
Functional interfaces are interfaces with a single abstract method, used for lambda expressions.
Streams provide a way to work with sequences of elements and perform operations on them.
Default methods allow interfaces to h...
Program to print elements sorted using Java 8 features
Use Stream API to sort the elements
Use lambda expressions for sorting
Use the sorted() method to sort the elements
posted on 7 Apr 2024
I have 2 years of experience in ReactJS, including building interactive user interfaces and integrating with backend services.
Developed a responsive web application using ReactJS, Redux, and Material-UI
Implemented RESTful APIs to fetch and update data in the application
Utilized React Router for client-side routing and navigation
Worked on optimizing performance by using memoization and lazy loading techniques
React is a JavaScript library for building user interfaces.
React allows for building reusable UI components
It uses a virtual DOM for efficient updates
React is declarative, making it easier to reason about code
It is widely used in web development for its performance and flexibility
Redux is a predictable state container for JavaScript apps.
Redux is a state management library for React
It helps in managing the state of the application in a predictable manner
It follows a unidirectional data flow pattern
It has three main components: store, actions, and reducers
Store holds the state of the application
Actions are plain JavaScript objects that describe what happened
Reducers specify how the application's...
Create a react app with redux
I was interviewed in Aug 2021.
Round duration - 70 minutes
Round difficulty - Medium
The test started around 3 pm and was of 70 minutes. 3 coding questions were asked which were mainly on trees and number theory.
Develop a program to compute the factorial of a given integer 'n'.
The factorial of a non-negative integer 'n', denoted as n!
, is the product of all positive integ...
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
For every element in the array, we will run a loop on its right side. As soon as we find an element on its right side which is greater than it, we will break the loop, assign it as the NGE of this element, move forward, and do the same for the next element.
Space Complexity: O(1)Explanation:O(1)
No extra space is used.
Time Complexity: O(n^2)Explanation:O(N ^ 2), Where N is the number of elements ...
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...
We will traverse the Binary search tree from the root node till we find the node whose key value is given, and upon getting that, we return the ceil value of it.
The steps are as follows:
Round duration - 60 minutes
Round difficulty - Medium
Interviewer was very friendly and supportive. My interview happened on google meet. What is a View? What is Denormalization? Difference between “==” and “===” operators in js.
You are given an integer array ARR
. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...
In this approach, we consider every possible subarray that can be formed from the given array ‘ARR’. For every subarray ARR[i … j] considered, we need to check whether this is the smallest unsorted subarray or not.
The algorithm is as follows:
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Round duration - 60 minutes
Round difficulty - Medium
What are some of the advantages of Angular over other frameworks?
Determine if two nodes in a binary tree are cousins. Nodes are considered cousins if they are at the same level and have different parents.
In a binary tree, e...
Round duration - 10 minutes
Round difficulty - Easy
I got a call from HR in the evening around 6:30 pm.
Tip 1 : Do prepare such questions before hand only.
Tip 2 : Speak confidently.
Tip 1 : Do remember the names of the interviewers who took your interview.
Tip 1 : Do a research before hand about what does the company do.
Tip 1 : Practice at least 350 questions to have good hold on data structures
Tip 2 : Practice at least 100 - 150 company specific coding questions.
Tip 3 : Try to give timing contests to build up your speed.
Tip 1 : Keep your resume only of 1 page
Tip 2 : Showcase your major projects on the top
I was interviewed in Sep 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a string A
consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A
.
The main idea behind this approach is to use recursion. The idea is to compare the first character of the string A[i..j] with its last character. There are two possibilities:
Given two strings S
and T
, determine if S
follows the same pattern as T
.
A full match means there is a bijection between a letter of T
and a non-empty word of S
.
We will use two hashmaps ‘charToWord’ and ‘wordToChar’ to track which character of ‘T’ maps to which word of ‘S’ and which word of ‘S’ maps to which character of ‘T’, respectively.
Here is the algorithm:
Round duration - 40 Minutes
Round difficulty - Easy
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...
In a set of linked ninja villages, the goal is to determine if a stronger ninja exists in the nearest village linked ahead. Given a linked list of 'N' in...
We will iterate through the given linked list of elements (nodes) with the help of two nested loops. Where we will check for every node whether there exists a next node with a value bigger than the value of current node and subsequently build the ‘ans’ list (array) and return it.
The algorithm will be-
Round duration - 15 Minutes
Round difficulty - Easy
Tip 1 : Be consistent, practice regularly whatever you read/study.
Tip 2 : Apply what you learn through code.
Tip 1 : Have some projects on your resume.
Tip 2 : If you have an internship or training explain it in a proper way like what are the techniques you learned during your training.
posted on 5 Apr 2023
Easy questions were asked. Practice aptitude questions from net along with javascript
A servlet in Java is a server-side component that extends the capabilities of servers.
Create a class that extends HttpServlet
Override the doGet or doPost method
Implement the logic for handling requests and generating responses
Register the servlet in web.xml or using annotations
Some of the top questions asked at the PayPal Full Stack Engineer interview -
Software Engineer2
286
salaries
| ₹15 L/yr - ₹45 L/yr |
Software Engineer III
247
salaries
| ₹17 L/yr - ₹66 L/yr |
Software Engineer
242
salaries
| ₹13.5 L/yr - ₹50 L/yr |
Senior Software Engineer
228
salaries
| ₹15 L/yr - ₹53 L/yr |
Risk Analyst
165
salaries
| ₹4.8 L/yr - ₹11 L/yr |
Paytm
Razorpay
Visa
MasterCard