Tip 1 : Practice Top 400 questions of DSA and understand the concept so that if any twisted question were asked, then you must be able to rite the code. Questions helped me to crack the interview: https://takeuforward.org/strivers-a2z-dsa-course/strivers-a2z-dsa-course-sheet-2/
Tip 2 : Understand the DBMS, OOPs etc. concept and try to apply the same in your projects.
Tip 3 : Do atleast three projects and try to apply the concept of DBMS while creating database. And do IOT based projects and try to build it from scratch, like making our own API etc.
Tip 1 : Have atleast three projects in your resume with proper knowledge and add git code link and try to make live as well like for website, we have heroku , 000 Webhost etc.as free platform to host the websites.
Tip 2 : Add only those skills that your good at.
Round 1 was MCQ of type questions based on DBMS(Database Management System), Computer Networking , Operating System and DSA (Data Structures and Algorithms), finding the errors and writing the missing code etc. There were a total 30 MCQs and the test was conducted on EduThrill Platform.
What is a Join? List its different types.
Tip 1 : Prepare top questions
Tip 2 : Practice SQL on Hackerrank
What is the difference between DROP and TRUNCATE statements?



Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.



link: https://leetcode.com/problems/linked-list-cycle/
Given head, the head of a linked list, determine if the linked list has a cycle in it.
There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter.
Return true if there is a cycle in the linked list. Otherwise, return false.
Example 1:
Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where the tail connects to the 1st node (0-indexed).
Firstly the interviewer asked me to introduce myself and then he asked me questions related to one of my projects.
Details about my project : I built an e-commerce android application and I published that app on playstore as well. The main use case of that application is to sell the farmers' product to consumers directly.
So, the Interviewer asked me to create a Database design of an android application and after that he asked me the questions to check my knowledge of DBMS and how I used the DBMS concept in that like normalization etc.



Given the root of a binary tree, return its maximum depth.
A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.



Given a binary tree, determine if it is height-balanced.
Interviewer asked me to solve 2 questions and after that he asked the questions on DBMS , Networking , OOPs, and DSA



You are given weights and values of N items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. Note that we have only one quantity of each item.
In other words, given two integer arrays val[0..N-1] and wt[0..N-1] which represent values and weights associated with N items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or dont pick it (0-1 property)



Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
Basics HR questions were asked
Introduce yourself.
What are your strengths & weaknesses?
Why should we select you?
Any Questions for me?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?