Worldline Group Full Stack Developer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

It was in the evening, at around 3 - 4 PM. There were 3 coding questions. One easy, two moderate ones. The platform had autocomplete feature too.

Q1. 
Problem Statement: Parity Move
You have an array of integers, and your task is to modify the array by moving all even numbers to the beginning while placing all odd numbers at the end. The order within ev...read more
Ans. 
Move all even numbers to the beginning and odd numbers to the end of an array.
• Iterate through the array and swap even numbers to the front and odd numbers to the back.

• Use two pointers, one starting from the beginning and one from the end, to achieve the desired arrangement.

• Return the modified array with even numbers at the start and odd numbers at the end.
Answered by AI
Add your answer
Q2. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Determine if two strings are anagrams of each other by checking if they have the same characters in different order.
• Create a character frequency map for both strings and compare them.

• Sort both strings and compare if they are equal.

• Use a hash table to store character counts and check if they are the same for both strings.
Answered by AI
Add your answer
Q3. 
LCA in a Binary Search Tree
You are given a binary search tree (BST) containing N nodes. Additionally, you have references to two nodes, P and Q, within this BST.
Your task is to determine the Lowest Com...read more
Ans. 
Find the Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree (BST).
• Traverse the BST from the root node to find the LCA of the given nodes.

• Compare the values of the nodes with the values of P and Q to determine the LCA.

• If the values of P and Q are on opposite sides of the current node, then the current node is the LCA.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

They asked 2 coding questions and 2 sql queries in this round

Q1. 
Find the Longest Palindromic Substring
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...read more
Ans. 
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
• Iterate through each character in the string and expand around it to find palindromes

• Keep track of the longest palindrome found and its starting index

• Return the substring starting from the index of the longest palindrome found
Answered by AI
Add your answer
Q2. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
• Iterate through the array and calculate the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water at each bar to get the total trapped water for the entire array.
Answered by AI
Add your answer
Q3. What is a nested SQL query?
Ans. 
A nested SQL query is a query within another query, used to retrieve data from multiple tables in a single query.
• Nested queries are enclosed within parentheses and can be used in SELECT, INSERT, UPDATE, or DELETE statements.

• They are commonly used to perform subqueries to filter results based on the output of the inner query.

• Example: SELECT * FROM table1 WHERE column1 IN (SELECT column2 FROM table2 WHERE condition);
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round was about OS, networking and my projects. What are the different ways to style a React component?
Name a few techniques to optimize React app performance.

Round duration - 30 Minutes
Round difficulty - Easy

It was a fun round, in which they ask about your preferences about programming languages, technologies or your hobbies. If you reach this round, it means that your chances of selection are 99%.

Q1. What was the biggest hurdle you faced while developing a project?
Add your answer

Q1. Sal queries simeple data structure question finding largest number in am array.
Add your answer
Q2. Solid principal
Add your answer

It will be a basic maths questions.

As a general topic of trend in world.

To be known for programming knowledge about us.

Q1. Programming oridanited
Add your answer
Q2. Skill knowledge questions
Add your answer

Q1. Tell me about your self.
Ans. 
I am a passionate Full Stack Developer with experience in building web applications using various technologies.
• Experienced in front-end technologies like HTML, CSS, JavaScript, and frameworks like React and Angular

• Proficient in back-end technologies like Node.js, Express, and databases like MongoDB and SQL

• Familiar with version control systems like Git and deployment tools like Heroku
Answered by AI
Add your answer
Q2. Family background .
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

This was a coding round conducted from 12 PM to 2 PM and it was not proctored but we could not switch the tabs. There were 2 coding questions each of 100 marks. The MCQ had HTML,CSS, JS, SQL, Coding and aptitutude questions.

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

• Generate valid configurations recursively and backtrack when a solution is not possible.
Answered by AI
Add your answer
Q2. 
Rearrange String Problem Statement
Given a string ‘S’, your task is to rearrange its characters so that no two adjacent characters are the same. If it's possible, return any such arrangement, otherwise re...read more
Ans. 
Given a string, rearrange its characters so that no two adjacent characters are the same. Return 'Yes' if possible, 'No' otherwise.
• Iterate through the string and count the frequency of each character

• Use a priority queue to rearrange characters based on frequency

• Check if the rearranged string has no two adjacent characters the same

• Return 'Yes' if possible, 'No' otherwise
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

There were two interviewers. They started by asking me to introduce myself and asked me to explain any one of my projects in my resume and after that, they asked me about the ML algorithms used in my project and about the difficulties faced. What is NaN property in JavaScript? This took around 10 minutes. They also asked 2 coding questions.
It was conducted at 10 AM on CodePair and MS Teams. Interviewers were friendly.

Q1. 
Group Anagrams Together
Given an array/list of strings STR_LIST, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.
E...read more
Ans. 
Group anagrams in a list of strings together and return each group as a list of strings.
• Iterate through the list of strings and sort each string alphabetically to create a key for grouping.

• Use a hashmap to store the sorted string as key and the original string as value.

• Return the values of the hashmap as the grouped anagrams.
Answered by AI
Add your answer
Q2. 
Friends Pairing Problem
The task is to determine the total number of ways to pair up 'N' friends or leave some of them single, following these rules:
1. Each friend can either pair with one other friend ...read more
Ans. 
The task is to determine the total number of ways to pair up 'N' friends or leave some of them single.
• Use dynamic programming to solve the problem efficiently.

• Consider the base cases when N is 1, 2, and 3 to derive the general formula.

• The result should be computed modulo 10^9 + 7 to handle large outputs.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

There were 2 questions based on data structures, the round started from 1.15 PM .Some SQL questions like What is a Subquery? What are its types? What are UNION, MINUS and INTERSECT commands?

Q1. 
Vertical Order Traversal Problem Statement
You are given a binary tree, and the task is to perform a vertical order traversal of the values of the nodes in the tree.
For a node at position ('X', 'Y'), th...read more
Ans. 
Perform vertical order traversal of a binary tree based on decreasing 'Y' coordinates.
• Traverse the binary tree level by level and maintain the position of each node

• Use a map to store nodes at each position and sort them based on 'Y' coordinates

• Print the nodes in sorted order for each position to get the vertical order traversal
Answered by AI
Add your answer
Q2. 
Divide Two Integers Problem Statement
You are given two integers dividend and divisor. Your task is to divide the integers without using multiplication, division, and modular operators. Return the quotien...read more
Ans. 
Divide two integers without using multiplication, division, and modular operators, returning the floored value of the quotient.
• Implement division using bit manipulation and subtraction

• Handle edge cases like negative numbers and overflow

• Return the floored value of the quotient
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The round was at 7.30 PM and I was asked to introduce myself and we had basic talk on where I live and my interests. I asked about the work culture and about the role at the end.

Q1. You are presented with a puzzle where there are n balloons, and your task is to burst the maximum number of balloons using an arrow. How would you approach solving this puzzle?
Add your answer

Q1. What are the java 1.8 features?
Ans. 
Java 1.8 introduced several new features including lambda expressions, functional interfaces, streams, and default methods.
• Lambda expressions allow you to write code in a more concise and readable way.

• Functional interfaces are interfaces with a single abstract method, used for lambda expressions.

• Streams provide a way to work with sequences of elements and perform operations on them.

• Default methods allow interfaces to h...read more
Answered by AI
Add your answer
Q2. Write program to print element sorting by using java 8 feature.
Ans. 
Program to print elements sorted using Java 8 features
• Use Stream API to sort the elements

• Use lambda expressions for sorting

• Use the sorted() method to sort the elements
Answered by AI
Add your answer

Q1. System design interview
Add your answer

Round duration - 70 minutes
Round difficulty - Easy

there was some coding questions and some mcqs related to js, html, css, java and aptitude.

Q1. 
Bridge in Graph Problem Statement
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...read more
Ans. 
Find all the bridges in an undirected graph by identifying edges that, when removed, increase the number of connected components.
• Use Tarjan's algorithm to find bridges in the graph.

• Keep track of the discovery time and low time of each vertex during DFS traversal.

• An edge (u, v) is a bridge if low[v] > disc[u].

• Handle multiple test cases efficiently to find bridges in each graph.

• Ensure the output contains the count of ...read more
Answered by AI
Add your answer
Q2. 
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...read more
Ans. 
The task is to find the maximum amount of money Mr. X can rob from houses arranged in a circle without alerting the police.
• The problem can be solved using dynamic programming.

• Create two arrays to store the maximum amount of money robbed when considering the first house and when not considering the first house.

• Iterate through the array and update the maximum amount of money robbed at each house.

• The final answer will be ...read more
Answered by AI
Add your answer