Soft Suave Technologies Interview Questions and Answers

Generate an n*n matrix of prime numbers and print them in a spiral order.

• 1. Generate prime numbers using the Sieve of Eratosthenes.

• 2. Fill an n*n matrix with the first n*n prime numbers.

• 3. Implement a spiral traversal algorithm to print the matrix.

• 4. Example: For n=3, the matrix would be filled with primes: [[2, 3, 5], [7, 11, 13], [17, 19, 23]].

• 5. The output for n=3 in spiral order would be: 2 3 5 13 23 19 17 11 ...read more

JDK, JRE, and JVM are essential components of Java programming, enabling development, execution, and management of Java applications.

• JDK (Java Development Kit) is a software development kit that includes JRE and development tools like compilers and debuggers.

• JRE (Java Runtime Environment) provides the libraries and components necessary to run Java applications but does not include development tools.

• JVM (Java Virtu...read more

Interfaces define contracts for classes, while abstract classes provide a base with shared code and can have state.

• An interface can only declare methods, while an abstract class can declare methods and provide some implementation.

• A class can implement multiple interfaces but can inherit from only one abstract class.

• Interfaces are used for defining capabilities (e.g., Comparable), while abstract classes are used fo...read more

This question assesses your coding skills and problem-solving abilities through practical coding tasks.

• Understand the problem statement clearly before coding.

• Break down the problem into smaller, manageable parts.

• Write clean, efficient code with proper variable naming.

• Test your code with various test cases to ensure accuracy.

• Consider edge cases and performance implications.

Java program to find duplicates in an array using map

• Create a HashMap to store the elements of the array as keys and their count as values

• Iterate through the array and check if the element is already present in the map

• If present, increment the count of the element in the map

• If not present, add the element to the map with count as 1

• Print the elements with count greater than 1

Minimum loss calculation in an array of strings.

• Convert string array to integer array

• Sort the integer array in ascending order

• Calculate the difference between adjacent elements

• Return the minimum difference

Modify a string by adding an integer to numbers and reversing them based on a boolean flag.

• Identify all numbers in the string.

• Add 'n' to each identified number.

• If 'inverse' is true, reverse the digits of the modified number.

• Example: For 'abcd 24', with n=5 and inverse=true, result is 'abcd 92'.

• Example: For 'def 15', with n=5 and inverse=true, result is 'def 02'.

Different types of waits in Selenium include implicit wait, explicit wait, and fluent wait.

• Implicit wait: Waits for a certain amount of time before throwing an exception if an element is not immediately available.

• Explicit wait: Waits for a specific condition to be met before proceeding with the next steps.

• Fluent wait: Waits for a certain condition to be satisfied with a defined polling frequency.

• Examples: Thread.s...read more