Tip 1 : Must do Previously asked Interviews Questions.
Tip 2 : Prepare OS, DBMS, OOPs, Computer Networks well.
Tip 3 : Prepare well for one project mentioned in the resume, the interviewer may ask any question related to the project, especially about the networking part of the project.
Tip 1: Have at least 2 good projects mentioned in your resume with a link
Tip 2: Focus on skills, internships, projects, and experiences.
Tip 3: Make it simple, crisp, and one page
This was online test taken on the mettl platform. The test consist of 20 MCQs questions and one coding question.
Given an integer array nums, design an algorithm to randomly shuffle the array. All permutations of the array should be equally likely as a result of the shuffling.
Implement the Solution class:
Solution(int[] nums) Initializes the object with the integer array nums.
int[] reset() Resets the array to its original configuration and returns it.
int[] shuffle() Returns a random shuffling of the array.
Example 1:
Input
["Solution", "shuffle", "reset", "shuffle"]
[[[1, 2, 3]], [], [], []]
Output
[null, [3, 1, 2], [1, 2, 3], [1, 3, 2]]
Explanation
Solution solution = new Solution([1, 2, 3]);
solution.shuffle(); // Shuffle the array [1,2,3] and return its result.
// Any permutation of [1,2,3] must be equally likely to be returned.
// Example: return [3, 1, 2]
solution.reset(); // Resets the array back to its original configuration [1,2,3]. Return [1, 2, 3]
solution.shuffle(); // Returns the random shuffling of array [1,2,3]. Example: return [1, 3, 2]
Constraints:
1 <= nums.length <= 50
-106 <= nums[i] <= 106
All the elements of nums are unique.
At most 104 calls in total will be made to reset and shuffle.
lass Solution {
public boolean isMonotonic(int[] nums) {
boolean increasing = true;
boolean decreasing = true;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] < nums[i + 1]) {
decreasing = false;
}
if (nums[i] > nums[i + 1]) {
increasing = false;
}
}
return increasing || decreasing;
}
}
This was technical round taken by the senior data engineer at the Cisco. The interviewer started with giving his introduction and asking for my introduction.
He asked about my previous work exprience and projects
What is good data vs bad data
Some SQL based queries
What is normalization
2 NF form
Pillars of OOPs



Given array/list can contain duplicate elements.
(arr[i],arr[j]) and (arr[j],arr[i]) are considered same.
C++ Solution Using Hashmaps
class Solution {
public:
vector twoSum(vector& nums, int target) {
map m;
vector v;
for(int i=0;i {
if(m.find(target-nums[i])!=m.end())
{
v.push_back(m[target-nums[i]]);
v.push_back(i);
return v;
}
m[nums[i]]=i;
}
return v;
}
};
This was technical + HR round taken by two managerial level person from Cisco
Introduction
Why do you want to join cisco
what is data engineering
Explain briefly about the internal working of Hadoop
Tell me something which is not written in the resume.
Project architecture discussion and some cross-question why using this tech.
Some questions related to the cluster configuration
Why should we hire you
Tip 1: Make sure your resume is up-to-date
Tip 2: Be confident and focus on your communication
Tip 3: Prepare for the behavioral questions



If the first linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL and the second linked list is 4 -> 5 -> NULL.
The two numbers represented by these two lists are 12345 and 45, respectively. So, adding these two numbers gives 12390.
So, the linked list representation of this number is 1 -> 2 -> 3 -> 9 -> 0 -> NULL.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: