Tagit Pte Lead Software Engineer Interview Questions and Answers

Q1. Authentication Jwt Classloaders
Add your answer
Q2. Implementation of hashmap
Ans. 
HashMap is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.
• HashMap uses a hash function to map keys to indices in an array.

• Collision handling is important in HashMap implementation.

• Java's HashMap class is a popular implementation of this data structure.
Answered by AI
Add your answer

Aptitude Had around 50 Questions which cover Logical,Quantitative, Code snippets

Q1. Two Sum in Coding
Ans. 
Find two numbers in an array that add up to a specific target value.
• Use a hashmap to store the difference between the target value and each element in the array.

• Iterate through the array and check if the current element's complement exists in the hashmap.

• Return the indices of the two numbers that add up to the target value.
Answered by AI
Add your answer
Q2. Differences in final,Finally,Finalize
Ans. 
final, finally, and finalize are related terms in programming but have different meanings and usage
• final is a keyword in Java used to restrict inheritance, method overriding, and variable reassignment

• finally is a block of code in exception handling that always executes, regardless of whether an exception is thrown

• finalize is a method in Java used for cleanup operations before an object is garbage collected
Answered by AI
Add your answer
Q3. Basic Sql operations
Add your answer

Q1. Array List Implementation in Stack for Push and pop
Ans. 
Array List can be implemented in a stack by using an array and keeping track of the top element.
• Create an array to store the elements of the stack.

• Keep track of the top element using a variable.

• For push operation, add the element to the top of the stack and increment the top index.

• For pop operation, remove the top element and decrement the top index.
Answered by AI
Add your answer
Q2. Finding 3rd Largest Number in an Array without using Sort
Ans. 
Find 3rd largest number in array without sorting
• Iterate through array to find largest, 2nd largest, and 3rd largest numbers

• Keep track of these numbers as you iterate

• Return the 3rd largest number found
Answered by AI
Add your answer
Q3. Finding the min number of Swap in Sorting of Array
Ans. 
To find the minimum number of swaps needed to sort an array
• Use graph theory to find cycles in the array

• Count the number of swaps needed to fix each cycle

• Add up the swaps needed for all cycles to get the total minimum swaps
Answered by AI
Add your answer

Q1. Fibonacci, swap without 3rd var
Add your answer
Q2. Non repetitive char in string
Ans. 
Find the first non-repetitive character in a string.
• Iterate through the string and count the occurrences of each character.

• Return the first character with a count of 1.
Answered by AI
Add your answer

Scenario based questions

Basic DSA linked list, stack etc

System design food delivery application

Q1. Tell me about yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java, Python, and web development technologies

• Strong problem-solving skills

• Team player with excellent communication skills
Answered by AI
Add your answer
Q2. Why Appviewx and what do u know about it
Add your answer

Q1. What is content security Policy
Ans. 
Content Security Policy (CSP) is a security standard that helps prevent cross-site scripting (XSS) attacks by allowing website owners to control which resources can be loaded on their site.
• CSP is implemented using an HTTP header that specifies approved sources of content such as scripts, stylesheets, images, fonts, and more.

• It helps protect against XSS attacks by restricting the sources from which certain types of cont...read more
Answered by AI
Add your answer
Q2. React question to have directory sturcture listing
Add your answer

Q1. How to identify if a queue is circular
Ans. 
A circular queue can be identified by checking if the rear pointer is one position behind the front pointer.
• Check if rear pointer is one position behind front pointer

• Check if front pointer is at index 0 and rear pointer is at index n-1 in an array of size n

• Check if front pointer is at index rear+1 modulo n in an array of size n
Answered by AI
Add your answer

Q1. Design notification system
Ans. 
Design a notification system for a software application.
• Identify the types of notifications needed (e.g. email, SMS, in-app)

• Consider the frequency and urgency of notifications

• Implement a notification queue to handle multiple notifications

• Include user preferences for notification settings

• Utilize push notifications for real-time updates
Answered by AI
Add your answer

Write multiple polyfills for array

Q1. What is let, const and var?
Ans. 
let, const, and var are keywords used for variable declaration in JavaScript.
• let is block-scoped and can be reassigned.

• const is block-scoped but cannot be reassigned.

• var is function-scoped and can be reassigned.
Answered by AI
Add your answer