Tip 1 : Even if you are stuck in the problem, just give a try. The interviewer will help you definitely for sure.
Tip 2 : Prepare Data Structures and Algorithms well. They mostly check our Problem-Solving ability to find the solutions for the real-world problems.
Tip 3 : Be enough confident, don't be nervous. Maintain at least 2 projects in your resume
Tip 1: Mention at Least 2 Projects
When discussing your experience, make sure to highlight at least two significant projects that showcase your skills and accomplishments. Describe your role, the problem you solved, the technologies used, and the impact of the projects.
Tip 2: Highlight Your Proficient Skills
I excel in several key areas, including:
Tip 3: Concise, Yet Comprehensive
Strike a balance between brevity and comprehensiveness. Your description should provide enough detail to showcase your skills and experience while remaining concise.
This was technical mcq round in which mostly questions were on computer networking also of basic electrical and electronics questions.



Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams.
'triangle' and 'integral'
'listen' and 'silent'
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct.
You are given two strings 'str1' and 'str1'.
You have to tell whether these strings form an anagram pair or not.
The strings form an anagram pair if the letters of one string can be rearranged to form another string.


Input: [1,2,3,4,5]
Output: [5,4,3,2,1]

Reverse a given stack of N integers using recursion. You are required to make changes in the input parameter itself.



1. For all such levels where there is only one corner node the leftmost and the rightmost nodes are the same.
2. In the output, you have to print the leftmost and rightmost values in level order fashion i.e, the leftmost node of level1 followed by the rightmost node of level1 followed by the leftmost node of level2 followed by the rightmost node of level2 and so on.
You are given an arbitrary binary tree with N nodes, whose nodes have their values in the range of integers. You have to print the values of leftmost and rightmost nodes at each level of the given tree. In other words, for every level in the given tree, print the values of corner nodes.



You have been given a Singly Linked List of integers, determine if it forms a cycle or not. If there is a cycle, remove the cycle and return the list.



Input: 'a' = [7, 12, 1, 20]
Output: NGE = [12, 20, 20, -1]
Explanation: For the given array,
- The next greater element for 7 is 12.
- The next greater element for 12 is 20.
- The next greater element for 1 is 20.
- There is no greater element for 20 on the right side. So we consider NGE as -1.
For each element, find the next greater element to the rightmost index.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?