Globant Senior Developer Interview Questions and Answers

Q1. Strong consistency vs eventual consistency
Ans. 
Strong consistency ensures that all replicas of data are updated synchronously, while eventual consistency allows for temporary inconsistencies.
• Strong consistency guarantees that all clients see the same data at the same time.

• Eventual consistency allows for temporary inconsistencies but eventually all replicas will converge to the same state.

• Strong consistency is often used in systems where data integrity is critical, ...read more
Answered by AI
Add your answer
Q2. Calculate the size of the file system
Ans. 
Calculating the size of a file system
• Determine the total size of all files and directories within the file system

• Include the size of all subdirectories and their contents

• Consider the size of metadata and file system overhead

• Use appropriate tools or commands to gather the necessary information
Answered by AI
Add your answer

Q1. Write a program code for binary search
Ans. 
Binary search program code in Python
• Define a function that takes a sorted array and a target value as input

• Initialize two pointers, low and high, to the start and end of the array

• While low is less than or equal to high, calculate mid as (low + high) // 2 and compare array[mid] with target

• If array[mid] is equal to target, return mid

• If array[mid] is less than target, update low to mid + 1

• If array[mid] is greater than tar...read more
Answered by AI
Add your answer
Q2. C++ constructors
Add your answer

Question related to operating system and computer network

Q1. Traverse all child nodes in tree
Add your answer

Q1. Question related to cloud and oops
Add your answer

Q1. Question related to my background and how web site work
Add your answer

3 coding dsa question
Difficulty is On your luck
My friends got easy level
I got medium level
Some got hard questions as well

Ssh round , quant and logical
Tip: bring your calculator

Q1. Two Puzzle : bulb switching and candle
Add your answer
Q2. Dsa questions such as string reverse, binary search
Add your answer
Q3. Dbms and os core subject questions
Add your answer

Q1. How are you better than others
Add your answer
Q2. Why should we hire you
Add your answer

In first round 4 coding question like 1 dsa 2 database and one is api and question is very simple . coding round was conducted in hackerrank

Q1. DSA QUESTION LIKE TREE AND GRAPH
Add your answer
Q2. DP AND SORTING APPROACH
Add your answer

Again same but dsa question and oops concept in deep level

Q1. Bubble sort and array was given
Add your answer
Q2. Create binary tree
Ans. 
A binary tree is a data structure where each node has at most two children.
• Start by creating a Node class with left and right child pointers.

• Implement methods to insert, search, and delete nodes in the tree.

• Consider different traversal methods like inorder, preorder, and postorder.
Answered by AI
Add your answer
Q3. HightBuilding Pattern
Add your answer

Q1. Rest Apis questions
Add your answer

Q1. Core java and OOPS and LLD
Add your answer