Upload Button Icon Add office photos

Sonata Software

Compare button icon Compare button icon Compare

Filter interviews by

Sonata Software Senior Java Developer Interview Questions, Process, and Tips

Updated 28 Sep 2022

Sonata Software Senior Java Developer Interview Experiences

1 interview found

I applied via Naukri.com and was interviewed before Jan 2021. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(8 Questions)

  • Q1. Old project tech stack and architecture
  • Q2. When to use abstract class and when should we use interfaces in Java?
  • Ans. 

    Abstract classes are used for code reuse and interfaces are used for multiple inheritance and loose coupling.

    • Abstract classes can have both abstract and non-abstract methods while interfaces can only have abstract methods.

    • Abstract classes can have constructors while interfaces cannot.

    • Interfaces are used when a class needs to implement multiple behaviors while abstract classes are used for code reuse.

    • Interfaces promote ...

  • Answered by AI
  • Q3. ArrayList vs LinkedList
  • Ans. 

    ArrayList is better for random access, LinkedList is better for frequent insertion/deletion.

    • ArrayList uses contiguous memory, LinkedList uses nodes

    • ArrayList is faster for accessing elements by index

    • LinkedList is faster for adding or removing elements in the middle of the list

    • ArrayList is better for small lists, LinkedList is better for large lists

  • Answered by AI
  • Q4. Internal working of HashMap
  • Ans. 

    HashMap is a data structure that stores key-value pairs and uses hashing to retrieve values quickly.

    • HashMap uses an array of buckets to store key-value pairs

    • Each bucket contains a linked list of entries

    • Hashing is used to determine the index of the bucket where the entry should be stored

    • If multiple entries have the same hash code, they are stored in the same bucket as a linked list

    • When retrieving a value, the hash code ...

  • Answered by AI
  • Q5. Spring IOC, DI, Autowiring
  • Q6. ApplicationContext vs BeanFactory
  • Ans. 

    ApplicationContext is a sub-interface of BeanFactory in Spring Framework.

    • ApplicationContext provides more advanced features like AOP, i18n, event propagation, etc.

    • BeanFactory is a basic container that provides the fundamental functionality of DI and IOC.

    • ApplicationContext is preferred over BeanFactory in most cases due to its advanced features.

    • Example: ApplicationContext can be used to load properties files, whereas Be...

  • Answered by AI
  • Q7. Caching mechanisms used
  • Ans. 

    Caching mechanisms used

    • In-memory caching using ConcurrentHashMap or Guava Cache

    • Distributed caching using Redis or Hazelcast

    • HTTP caching using ETag or Last-Modified headers

    • Query caching using Hibernate or JPA

    • Page caching using Varnish or Squid

  • Answered by AI
  • Q8. AWS S3, EC2, Security Groups, VPC, Subnets
Round 3 - Behavioral 

(2 Questions)

  • Q1. Expectations from the project
  • Q2. Basic project overview was provided
Round 4 - HR 

(2 Questions)

  • Q1. What are your salary expectations?
  • Q2. Why are you looking for a change?

Interview Preparation Tips

Topics to prepare for Sonata Software Senior Java Developer interview:
  • Java
  • AWS
  • Database
  • Spring
Interview preparation tips for other job seekers - Technical Interview is divided up into 3 parts:
- Java
- Spring
- AWS

Focus more on Java and spring... Basic knowledge of AWS would suffice...

Skills evaluated in this interview

Interview questions from similar companies

I applied via Campus Placement and was interviewed before Sep 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basic of java, threading,SQl,angular

Interview Preparation Tips

Interview preparation tips for other job seekers - Communication should be good. be confident.

I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. 1. If you given a no return its corresponding excel no.
  • Ans. 

    Convert given no to corresponding excel no.

    • Excel no starts from 1 and goes up to 16384

    • Excel no is calculated using column and row numbers

    • For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on

  • Answered by AI
  • Q2. 2. find unique character in a window of k size in a string
  • Ans. 

    Find unique characters in a window of k size in a string.

    • Use a sliding window approach.

    • Maintain a hash table to keep track of character frequency.

    • Remove characters from hash table as the window slides.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Communication is very important. Give your solution from brute force to optimal. Interviewer has tell me to write code of both questions in any programming language.

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Oct 2016.

Interview Questionnaire 

2 Questions

  • Q1. Based on projects
  • Q2. Tricky questions

Interview Preparation Tips

Round: Test
Experience: There were three sections
Eg:- math aptitude and verbal
Each containing 20 question each
Tips: If one question is taking more than enough time switch to next
Duration: 1 hour
Total Questions: 60

Round: Technical Interview
Experience: During this round interviewer checked the knowledge of the student
Tips: Prepare well for your interview

Round: HR Interview
Experience: In this round interviewer checks the presence of mind of student
Tips: Be attentive

College Name: Chitkara University, Himachal Pradesh

I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Fibonacci series.

Interview Preparation Tips

Interview preparation tips for other job seekers - The interview was good

Interview Questionnaire 

1 Question

  • Q1. Java multithreading, oops
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Dec 2023.

Round 1 - Aptitude Test 

Such a nice experience

Round 2 - Coding Test 

Such a nice experience

Round 3 - Technical 

(1 Question)

  • Q1. Covered LinkedLists and Trees
Round 4 - One-on-one 

(1 Question)

  • Q1. Cultural Assessment Round

Interview Preparation Tips

Interview preparation tips for other job seekers - Such a nice experience i had
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I appeared for an interview in Jan 2025.

Round 1 - Coding Test 

Test will be in hacker rank there would be a difficulty level between easy to medium

Round 2 - Technical 

(1 Question)

  • Q1. Question will be from data structure and easy to medium level of the programming laanguage question
Round 3 - HR 

(1 Question)

  • Q1. This is just to check your english ability
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Normal question aptitude like probability, scenario based questions, english grammar questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Ds question , html, css, javascript, react js question

Sonata Software Interview FAQs

How many rounds are there in Sonata Software Senior Java Developer interview?
Sonata Software interview process usually has 4 rounds. The most common rounds in the Sonata Software interview process are Resume Shortlist, Technical and Behavioral.
How to prepare for Sonata Software Senior Java Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Sonata Software. The most common topics and skills that interviewers at Sonata Software expect are AWS, Core Java, EJB, JBoss and JPA.
What are the top questions asked in Sonata Software Senior Java Developer interview?

Some of the top questions asked at the Sonata Software Senior Java Developer interview -

  1. When to use abstract class and when should we use interfaces in Ja...read more
  2. ApplicationContext vs BeanFact...read more
  3. ArrayList vs LinkedL...read more

Tell us how to improve this page.

Sonata Software Senior Java Developer Salary
based on 7 salaries
₹6.8 L/yr - ₹26 L/yr
At par with the average Senior Java Developer Salary in India
View more details

Sonata Software Senior Java Developer Reviews and Ratings

based on 1 review

1.0/5

Rating in categories

1.0

Skill development

2.0

Work-life balance

1.0

Salary

1.0

Job security

1.0

Company culture

1.0

Promotions

1.0

Work satisfaction

Explore 1 Review and Rating
Consultant
623 salaries
unlock blur

₹6.5 L/yr - ₹19.3 L/yr

Senior System Analyst
608 salaries
unlock blur

₹3.8 L/yr - ₹12.4 L/yr

Software Engineer
374 salaries
unlock blur

₹3 L/yr - ₹13.1 L/yr

Digital Engineer
316 salaries
unlock blur

₹2.6 L/yr - ₹10.1 L/yr

System Analyst
312 salaries
unlock blur

₹3 L/yr - ₹10 L/yr

Explore more salaries
Compare Sonata Software with

ITC Infotech

3.6
Compare

3i Infotech

3.5
Compare

Cybage

3.8
Compare

Xoriant

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview