Coins beautiful sequence where on the left you would to have all heads and on the right tails. You are given a random sequence of heads and tails and you need to write an algorithm to show the fewest amount of coin flips needed to get beautiful sequence.
Can you give an example when you can't meet your commitment to a task?
It was a toposort+dp problem similar to parallel schedule 3.
how to debug ,core java , selenium
Sorry, could not expose due to agreement
What is best thing you have done in your project.
Asked about your project, frameworks. Followed by a coding test. Read all questions in Leet code website.
Various questions on my projects and intership and security related issues about the bug bounty done in round 1.
Basic question on Array and String (Leetcode Easy Level)
SDLC and STLC questions Rgression testing
Viewing 3271 - 3280 interview questions