Sigma Solve React Developer Interview Questions and Answers

Medium level questions asked

Simple easy to medium 2 questions asked of string and array

Q1. Tell me about yourself
Add your answer
Q2. JavaScript like fetch axios and others
Add your answer

Q1. What is observable and promises
Ans. 
Observables and promises are both used for handling asynchronous operations in JavaScript.
• Observables are used for handling multiple values over time, while promises are used for handling a single value at a time.

• Observables can be cancelled, while promises cannot be cancelled.

• Promises have a built-in mechanism for error handling using the catch method, while observables use the error callback function.

• Observables are ...read more
Answered by AI
Add your answer

Write a code for unique array

Node js vs express, var and const in js, cors

Java related and programming questions

Q1. Java basic questions
Add your answer
Q2. Springboot and Database question
Add your answer
Q3. Problem Solving subsequence longest
Ans. 
Find the longest subsequence in an array of strings
• Iterate through the array of strings and compare each string with the next one to find the longest common subsequence

• Use dynamic programming to efficiently find the longest common subsequence

• Example: ['abc', 'abg', 'bdf', 'aeg', 'acefg'] - The longest subsequence is 'aeg'
Answered by AI
Add your answer

Q1. They asked about spring security. and asked one problem to solve
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

They share doc file link which consist of 5 programming questions

Q1. Reverse Words in a String
You are given a string of length N. You need to reverse the string word by word. There can be multiple spaces between two words and there can be leading or trailing spaces but in ...read more
Ans. Brute force
• Create a String ans to store the reversed string.
• Initialize a variable i to 0 and iterate the whole string through a while loop.
• Skip initial spaces by just incrementing i.
• Create a String that will store the current word.
• Add the currentword and space at the beginning of ans.
• After traversing the whole string, check if the length of ans is greater than 0 then return ans after removing the last space otherwise r...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Fibonacci Member
Given a number N, figure out if it is a member of fibonacci series or not. Return true if the number is member of fibonacci series else false.
Fibonacci Series is defined by the recurren...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered by CodingNinjas
Add your answer
Q3. Maximum Difference
You are given an array 'ARR' of the 'N' element. Your task is to find the maximum difference between any of the two elements from 'ARR'.
If the maximum differen...read more
Ans. Find Max And Min
We will iterate over ARR and find the MAX and MIN of the ARR. And if the MAX - MIN is odd the return “ODD” else return "EVEN". 
The algorithm will be-
1. MAX = -1, MIN= 10 ^ 9 + 1
2. For VAL in ARR.
   1. If MAX < VAL
      1. MAX = VAL
   2. If MIN > VAL
      1. MIN = VAL
3. IF (MAX-MIN) % 2
   1. Return ODD
4. ELSE
   1. Return EVEN
Space Complexity: O(1)Explanation:
O(1).
 
Since constant space is used.
Time Complexity: O(n)Explanation:
O(N), where N ...read more
Answered by CodingNinjas
Add your answer
Q4. Remainder when divided by 11
You are given a number N. You need to find the remainder when N is divided by 11.
Note :
Number N may be very large.
Input format :
The first line contains an integer '...read more
Ans. Using Modulo Property
1. Since the number is very large we can not simply calculate N % 11.
2. Now, any number say 256 % 11 can be calculated as (25*10 + 6)%11. Which in turn can be calculated as (( 25*10)%11+ 6)%11 or ( (25%11)*10 + 6)%11. Similarly 25%11 can be calculated as (2*10+5)%11. Therefore , 256 %11 can be finally calculated as ( ( (2*10 + 5)%11 )*10 + 6)%11.
3. So, the idea is to store the number N in string Str.
4. Take a ...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

In this round interviewer asked me to solve 3 programming questions.

Q1. Selection Sort
Selection sort is one of the sorting algorithms that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning of the unsorted regio...read more
Ans. Selection Sort Approach
Selection sort is a standard sorting algorithm that uses nested loops to find all the minimum elements in the array in each iteration and swap them with the starting element of the unsorted region of the array.
 
Steps :
• Use a minValue variable to find the index of the minimum element of the array.
• Use a loop to iterate over all the elements of the array.
• Use a nested loop to find the minimum ele...read more
Answered by CodingNinjas
Add your answer
Q2. String Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters.
Palindrome
A palindrome is a word, number, phrase, or other sequences of characters which read...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered by CodingNinjas
Add your answer
Q3. Star Pattern
Print the following pattern
Pattern for N = 4


The dots represent spaces.



Input Format :
N (Total no. of rows)
Output Format :
Pattern in N lines
Constraints :
0 <= N <=...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was the HR round. They asked me simple HR questions and 1 coding question.

Q1. Basic HR Questions
What experience do you have that would be relevant to this role?
What do you know about our company’s product/services?
Ans. 
Tip 1 : Stick to your first answer and that will show the confidence.
Tip 2 : Give genuine answers and be confident.
Answered by CodingNinjas
Add your answer
Q2. Count characters
Write a program to count and print the total number of characters (lowercase english alphabets only), digits (0 to 9) and white spaces (single space, tab i.e. '\t' and newline i.e....read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer