Prueba técnica de

JAVA DEVELOPER

Estimado aplicante. Solo debes completar la prueba técnica 1 vez, el objetivo es identificar el nivel de dominio en programación que posees.

Inmediatamente envíes esta prueba técnica, recibirás en tu correo electrónico los siguientes pasos que debes seguir en tu proceso de inscripción. Por favor, asegúrate de leer las preguntas detenidamente y responder lo mejor que puedas.

¡Mucho éxito!

First Name

Last Name

Which SOLID principle is this code violating?

Interface Segregation

Liskov Substitution

Open / Closed

Single Responsibility

None

Given the following array of integers in Java:

After applying the sorting algorithm Arrays.sort(numbers);, what will be the content of the numbers array?

{1, 4, 3, 5, 8}

{3, 1, 4, 5, 8}

{8, 5, 4, 3, 1}

{1, 3, 4, 5, 8}

None

It is a generic template for a set of objects with similar characteristics.

Class

Method

Objects

Functions

None

The SET clause is used in which of the following SQL statements?

SELECT

UPDATE

DROP

DEELTE

None

Which of the following series will be printed by the given pseudocode?

7 7 7

7 18 14

7 10 15

7 14 10

None

What result will the following code show?

None

Search Insert Position

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You must write an algorithm with O(log n) runtime complexity.

Example 1:
Input: nums = [1,3,5,6], target = 5
Output: 2

Example 2:
Input: nums = [1,3,5,6], target = 2
Output: 1

Example 3:
Input: nums = [1,3,5,6], target = 7
Output: 4

None

What Design Patterns category is Abstract Factory in?

Behavioural

Creational

Graps

Structural

None

Search in Rotated Sorted Array

There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], …, nums[n-1], nums[0], nums[1], …, nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2].
Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums. You must write an algorithm with O(log n) runtime complexity.

Example 1:
Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2:
Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

Example 3:
Input: nums = [1], target = 0
Output: -1

None

10.

It is considered as the main field of a table in the database:

FOREIGN KEY

UNIQUE DATA

PRIMARY KEY

1ST NORMAL FORM

None

11.

What does the INSERT statement do?

INSERT statement adds one or more records to a table

The INSERT statement deletes one or more records from a table.

INSERT statement updates one or more records to a table

The INSERT statement edits one or more records to a table

None

12.

What will be the output of the following pseudocode?

7 14 10

7 7 7

7 10 15

7 18 14

None

13.

Which of the following series will be printed by the given pseudocode?

1 1 2 3 5

2 4 6 8 9

1 2 3 4 5 6

1 3 6 10 15

None

14.

Suppose you have a functional interface called Calculator with a single abstract method called performOperation, which takes two numbers and returns a result. Below is the interface:

Now, consider the following MathOperations class that implements the Calculator interface:

Now, how could you use the MathOperations interface
Options: Calculator and class

to calculate the multiplication of 3.5 and 2.0?

None

15.

What is the correct definition of an abstract class?

Allows you to define new classes based on existing ones in order to reuse code.

Bring together all the elements that can be considered as belonging to the same entity.

They are characterized in that at least one of their methods must be declared abstract, which has no implementation, and the behavior of these methods is defined by the concrete classes that inherit it.

The ability to call different functions with the same name.

None

16.

Find First and Last Position of Element in Sorted Array

Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity.