Galaxy Weblinks UI Developer Interview Questions and Answers

Basic C test where our syntax and approach got tested

Aptitude and reasoning and verbal

1.Write a program to print sum of digital of numbers.
2.what program to swap two numbers with out using the third variable.
3. If a number is divisible by 91,then print "Foo".if a number is divisible by 97 then print"bar",if a number is divisible 91 and 97 then print"Foo bar".

Q1. Self interdiction wich language is comfortable , what is c,class,object, built-in functions, call by value, and call by reference , what is data structures and what is inter face inheritance and finally as...read more
Add your answer

Q1. How are you ?
Add your answer
Q2. What is teamwork for you ?
Add your answer

Q1. What is oop concept
Ans. 
OOP (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
• OOP focuses on creating objects that interact with each other to solve problems

• Encapsulation: Objects can hide their internal state and require interaction through methods

• Inheritance: Objects can inherit attributes and methods from parent objects

• Polymorphism: Objects can take on different forms o
Answered by AI
Add your answer

Simple Questions With MCQ Style

Q1. Ask About What I Know
Add your answer
Q2. Asked About How To Build Sysrem
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

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 without threatening 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 all valid configurations and print them out.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

Q1. 
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...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between
Answered by AI
Add your answer
Q2. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
Detect if a given linked list is circular by checking if it forms a closed loop.
• Traverse the linked list using two pointers, one moving at double the speed of the other.

• If the two pointers meet at any point, the linked list is circular.

• If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Leetcode easy, medium

Q1. Cpp , dsa , os, cn, coa
Add your answer
Q2. Sort 0,1,2 array
Ans. 
Sort an array of strings containing '0', '1', and '2'.
• Use counting sort algorithm to count the occurrences of '0', '1', and '2'.

• Create a new array with the sorted counts of '0', '1', and '2'.

• Join the sorted array back into a single array of strings.
Answered by AI
Add your answer

Q1. Why should we hire you?
Add your answer

Basic dsa questions , basic recursion questions of trees ,graphs and searching algorithms there are some mcq questions that too on dsa

They asked few sql and dsa questions like a open board test

Q1. Sort a vector according to other other vector ?
Ans. 
Sort a vector based on another vector
• Use std::sort with a custom comparator function

• The comparator function should compare the indices of the elements in the second vector

• The first vector should be sorted based on the order of the indices in the second vector
Answered by AI
Add your answer
Q2. String processing question where we need to process a string by using given instructions .
Add your answer

General on Online editors

Q1. Find the first occurrence of an element in an rotated array.
Add your answer

Pattern question based on Alphabets