Great working and learning environment, with a real opportunity for personal development. If you want it, no one will shout at you for doing the bare minimum; it's up to you what you decide to spend your time doing.
Within my team, there was a distinct lack of social activities. More team-building exercises and events would help.
There is also a slow corporate process involved in doing anything, from hiring new staff to requesting a wrist-support mouse mat. It is a waste of time and usually results in staff being unhappy.
Encourage your managers to take their staff for a coffee once a week at a bare minimum; enforce friendships.
Ideally, the staff should be friends. By allowing some cash from the budget to go toward team-building exercises, the staff will enjoy working together more, and work will become less of a chore.
Online assessment -> recruiter call -> technical interview -> manager interview. The technical interview covered OOP/SDLC and Java theory. Every interview stage included behavioral questions, and all the interviewers were extremely friendly. It was
Each presents himself. Talk about your projects. Java questions: * Functional Interface * How to define a Thread * Mutable and immutable types * Exceptions Hierarchy starting from Throwable * Overloading vs Overriding * final keyword * static keyw
Two medium-level DSA questions. The framing of the first question was slightly difficult to understand. It was a graph question related to Fenwick's tree. An array of integers is almost sorted if at most one element can be deleted from it to make it
Online assessment -> recruiter call -> technical interview -> manager interview. The technical interview covered OOP/SDLC and Java theory. Every interview stage included behavioral questions, and all the interviewers were extremely friendly. It was
Each presents himself. Talk about your projects. Java questions: * Functional Interface * How to define a Thread * Mutable and immutable types * Exceptions Hierarchy starting from Throwable * Overloading vs Overriding * final keyword * static keyw
Two medium-level DSA questions. The framing of the first question was slightly difficult to understand. It was a graph question related to Fenwick's tree. An array of integers is almost sorted if at most one element can be deleted from it to make it