ZET SDE Interview Questions and Answers

60 minutes of coding round with medium level of question asked

Coding and Aptitude MCQ questions

Q1. How i can design a login system for client?
Ans. 
Designing a login system for clients involves creating secure authentication methods and user management.
• Implement secure password hashing algorithms like bcrypt to store passwords securely.

• Use HTTPS to encrypt data transmission between client and server.

• Implement multi-factor authentication for added security.

• Utilize session management to keep track of user login status.

• Consider implementing account lockout mechanisms
Answered by AI
Add your answer
Q2. What is foreign key and how you can you can use foreign key in your DBMS system?
Ans. 
Foreign key is a key used to link two tables in a database, enforcing referential integrity.
• Foreign key is a column or a set of columns in one table that references the primary key in another table.

• It ensures that the values in the foreign key column(s) match the values in the primary key column of the referenced table.

• Foreign key constraints help maintain data integrity by preventing actions that would destroy links b...read more
Answered by AI
Add your answer

Q1. What is the shortest distance between two farthest vertices in a cubical room
Ans. 
The shortest distance between two farthest vertices in a cubical room is the length of the diagonal of the cube.
• The diagonal of a cube can be calculated using the formula: sqrt(3) * side length

• In a cube with side length 1 unit, the diagonal length is sqrt(3) units

• Therefore, the shortest distance between two farthest vertices in a cubical room is sqrt(3) times the side length of the cube
Answered by AI
Add your answer
Q2. A root 5 is the ans
Add your answer

Round duration - 180 minutes
Round difficulty - Hard

There was 1 round of 180 minutes which contains of 3 questions from DSA. the two question was of medium level but one question is of neither difficult nor medium level question based on tree

Q1. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Ans. 
Find the length of the longest strictly increasing subsequence in an array of integers.
• Use dynamic programming to keep track of the longest increasing subsequence ending at each element.

• Initialize an array to store the length of the longest increasing subsequence ending at each index.

• Iterate through the array and update the length of the longest increasing subsequence for each element.

• Return the maximum value in the ar...read more
Answered by AI
Add your answer
Q2. 
Bipartite Graph Problem
Check whether a given graph is bipartite or not. Return true if the graph's vertices can be divided into two independent sets, ‘U’ and ‘V’, such that every edge (‘u’, ‘v’) either c...read more
Ans. 
Check if a given graph is bipartite by dividing vertices into two independent sets.
• Use BFS or DFS to traverse the graph and assign colors to vertices to check for bipartiteness.

• If an edge connects vertices of the same color, the graph is not bipartite.

• Return true if all edges connect vertices of different colors, else return false.
Answered by AI
Add your answer
Q3. 
Count Inversions Problem Statement
Given an integer array ARR of size N containing all distinct values, determine the total number of inversions present in the array.
An inversion is defined for a pair o...read more
Ans. 
Count the total number of inversions in an integer array.
• Iterate through the array and for each pair of elements, check if the conditions for inversion are met.

• Use a nested loop to compare each element with all elements to its right.

• Keep a count of the inversions found and return the total count at the end.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

In interview I was asked about some question related to Data structures , DBMS . Some output based question was asked and 2 coding problems was given to solve.

Q1. 
Return Subsets Sum to K Problem Statement
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
Explanation:
A subset of an array 'ARR' is a tupl...read more
Ans. 
Given an array and an integer, return all subsets that sum to the given integer.
• Use backtracking to generate all possible subsets of the array.

• For each subset, check if the sum equals the given integer 'K'.

• Print the subsets that satisfy the condition.

• Example: For input [1, 2, 3] and K=3, subsets [1, 2] and [3] have sum 3.
Answered by AI
Add your answer
Q2. 
Boundary Traversal of Binary Tree
Given a binary tree of integers, your task is to print the boundary nodes of the binary tree in an anti-clockwise direction starting from the root node.
Note:
The boundary...read more
Ans. 
Boundary traversal of a binary tree in anti-clockwise direction starting from the root node.
• Implement a function to calculate the boundary traversal of a binary tree

• Include nodes from left boundary, leaf nodes, and right boundary in sequence

• Ensure only unique nodes are included in the output

• Print the boundary nodes separated by single spaces for each test case
Answered by AI
Add your answer

Q1. Project code which u have written in your resume
Ans. 
I have written a project code for a web application that tracks user activity and generates reports.
• Used HTML, CSS, and JavaScript for front-end development

• Utilized PHP and MySQL for back-end development

• Implemented user authentication and data visualization features
Answered by AI
Add your answer
Q2. Factorial code
Add your answer
Q3. SQL query
Add your answer

Basic dsa questions from leetcode

Basic question from the aptitude topics

Q1. Tell me about seld
Add your answer

Q1. 3 EMERGING TECHNOLOGIES
Add your answer

Lit bit tougher as a beginner for quants like aptitude, verbal, and reasoning.

They given 40 min for coding and , topics are below linked list , stacks

They given 30 min for coding in topics of linked list , stacks