Skip to content
Related Articles
Get the best out of our app
Open App

Related Articles

Service NOW Interview Experience

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

Technical Round-1:Face to Face interview

  • Given a string, find the 2nd non-repeating character in the string. Also, throw light upon the time and space complexity of it.
  • Name all sorting algorithms and explain along with their procedures and time complexities.
  • Another coding question related to Dijkstra’s Algorithm.
  • All of this was followed by a discussion involving Java basic concepts and oops such as 
    • threads
    • memory management
    • abstract
    • and other frontend-related questions such as circular border in CSS
    • how to call a function within a function
    • state vs prop
    • HTML tags
    • oops, concepts and some more react questions.

Verdict: Not selected for further rounds.

My Personal Notes arrow_drop_up
Last Updated : 02 Jan, 2023
Like Article
Save Article
Similar Reads