BigShyft Senior Software Engineer Interview Questions and Answers

Q1. 1. Questions around projects : JWT, UserAuthentication etc
Add your answer
Q2. 2. Write a code to find frequency of characters in a given string?
Ans. 
Code to find frequency of characters in a given string
• Use a hash table to store character frequencies

• Iterate through the string and update the hash table accordingly

• Print the hash table to display the character frequencies
Answered by AI
Add your answer

Q1. 1. Write a code to reverse a linked list?
Ans. 
Code to reverse a linked list
• Create three pointers: prev, curr, and next

• Initialize prev to null and curr to head

• Loop through the list and set next to curr's next node

• Set curr's next node to prev

• Move prev and curr one node ahead

• Return prev as the new head
Answered by AI
Add your answer
Q2. 2. Write a code to reverse linked list in size of K?
Ans. 
Code to reverse linked list in size of K
• Create a function that takes head of linked list and size K as input

• Traverse the linked list in groups of K nodes

• Reverse each group of K nodes using iterative or recursive approach

• Connect the reversed groups to form the final linked list

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q3. 3. Questions around project and design a database structure for comments system of quora?
Add your answer

Q1. Basic HR round questions
Add your answer

Given an simple gaming questions to be developed in JS

Given another UI design in image to be developed

Q1. Merge 2 Sorted linked list
Ans. 
Merge two sorted linked lists into a single sorted linked list
• Create a new linked list to store the merged result

• Iterate through both input linked lists and compare nodes to determine the order in which they should be merged

• Update the next pointers of the nodes in the new linked list accordingly
Answered by AI
Add your answer

Its was data structure and algorithm and SQL round 4 question of dsa and 2 question of sql

Q1. How does OTP less work make a systematic diagram for it/
Ans. 
OTP less work eliminates the need for one-time passwords for authentication.
• OTP less work uses alternative methods like biometrics, push notifications, or hardware tokens for authentication.

• It provides a more seamless and user-friendly authentication experience.

• Examples include fingerprint scanning on smartphones or security keys for two-factor authentication.
Answered by AI
Add your answer

Q1. Everything related to yourself.
Add your answer

50 mcq were asked in 12 mins. Most of the candidates qualified this round.

3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.

Q1. The technical round was of 40 mins. 3 standard questions from DSA were asked for which only approach was enough. Questions were from string, array and tree- Rotated string, Lowest common ancestor, etc.
Add your answer
Q2. Project related discussion regarding my role in the team.
Add your answer
Q3. A few HR questions related to family background. Why not go for higher studies like the rest of my family. Had to convince him that I saw more growth in working for an organisation.
Add your answer

Q1. My introduction then, standard HR questions like where do i see myself in coming yrs, why do i want to join the company, etc. It lasted 10 mins
Add your answer

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Q1. Difference between sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a specific order.
• Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

• Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

• For example, quick sort is generally faster than bubble sort for large data sets.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
• BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer