what is Big O? what is prototypal inheritance?
Junior Software Engineer Interview Questions
7,263 junior software engineer interview questions shared by candidates
There was a question about interface segregation principal.
In the technical interview, the interviewer primarily focused on my solution from the earlier coding round. They asked me to explain how and why I implemented the code in a particular way, and we discussed possible improvements. Most of the follow-up questions were related to Java concepts, including object-oriented programming, exception handling, and data structures.
Techical questions from JS, TS , React , Java, React
Minimum Time Takes to Reach Destination Without Drowning: You are given an n * m 0-indexed grid of string land. Right now, you are standing at the cell that contains "S", and you want to get to the cell containing "D". There are three other types of cells in this land: ".": These cells are empty. "X": These cells are stone. "*": These cells are flooded. At each second, you can move to a cell that shares a side with your current cell (if it exists). Also, at each second, every empty cell that shares a side with a flooded cell becomes flooded as well. There are two problems ahead of your journey: You can't step on stone cells. You can't step on flooded cells since you will drown (also, you can't step on a cell that will be flooded at the same time as you step on it). Return the minimum time it takes you to reach the destination in seconds, or -1 if it is impossible. Note that the destination will never be flooded. Example 1: Input: land = [["D",".","*"],[".",".","."],[".","S","."]] Output: 3 Explanation: The picture below shows the simulation of the land second by second. The blue cells are flooded, and the gray cells are stone. Picture (0) shows the initial state and picture (3) shows the final state when we reach destination. As you see, it takes us 3 second to reach destination and the answer would be 3. It can be shown that 3 is the minimum time needed to reach from S to D. Example 2: Input: land = [["D","X","*"],[".",".","."],[".",".","S"]] Output: -1 Explanation: The picture below shows the simulation of the land second by second. The blue cells are flooded, and the gray cells are stone. Picture (0) shows the initial state. As you see, no matter which paths we choose, we will drown at the 3rd second. Also the minimum path takes us 4 seconds to reach from S to D. So the answer would be -1. Example 3: Input: land = [["D",".",".",".","*","."],[".","X",".","X",".","."],[".",".",".",".","S","."]] Output: 6 Explanation: It can be shown that we can reach destination in 6 seconds. Also it can be shown that 6 is the minimum seconds one need to reach from S to D. Constraints: 2 <= n, m <= 100 land consists only of "S", "D", ".", "*" and "X". Exactly one of the cells is equal to "S". Exactly one of the cells is equal to "D".
Find middle element of LinkedList? Some medium level questions on array and string.
He asked "are you up for a challenge?" Thinking this was just like an interview question looking for hard workers, I said "absolutely". But then he replied with "okay, I will send you a few challenges to test your ability as a SWE and get back to you if you are what I am looking for". He said he wanted to discuss my qualifications, but claimed I didn't have any. Sent 3 C++ coding questions consisting of converting numbers to their written form, max height of a binary search tree, and a program that can be run via the command line.
General talk about OOP, explain Polymorphism.
How Spring prepare context? How we can add some custom logic at the very beginning of loading beans?
What inspired me to learn programming.
Viewing 7071 - 7080 interview questions