Tip 1: Read about the fundamentals of networking and cloud.
Tip 2: Try solving pseudocode and simple DSA problems.
Tip 3: Focus on aptitude, game-based assessment questions, and essay writing.
Tip 1: Add some good projects to your resume.
Tip 2: Add the number of DSA questions solved to your resume.
This is the first round, which mainly consists of three sections:
ARR = [2, 1, 2, 1, 5, 5, 2]
Output: 1 2
2 occurs three(odd) times.
1 occurs two(even) times.
5 occurs two(even) times.
So, the total 1 element is occurring an odd number of times and 2 elements are occurring an even number of times.
Use the Bitwise AND operator to solve the problem.
What is the output of the following code snippet?
#include <stdio.h>
int main() {
int y = 1;
if (y & (y = 2))
printf("true %d\n", y);
else printf("false %d\n", y);
}
Ans:- true 2
Which loop is guaranteed to execute at least once in programming?
(A) do-while
(B) while
(C) if
(D) for
Ans:- A) do while
Which data structure is used for implementing recursion?
(A) Stack
(B) Linked List
(C) Deque
(D) Queue
What is the time complexity of the Bubble Sort algorithm?
(A) O(n²)
(B) O(n)
(C) O(n log n)
There were 2 coding questions. The difficulty level of the questions was easy to medium.
Given 'S' : abcdg
Then output will be : 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
We can simply use a data structure like an unordered map to store the elements and their corresponding frequencies (i.e., the number of occurrences). At the end, print the elements with their respective number of occurrences from the map.
The time complexity for the solution discussed above would be: O(N). The space complexity for the solution would be: O(N).
If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.
We can use the stack data structure to solve this problem.
The steps to solve this problem using a stack are as follows:
The time complexity for the above solution is O(N).
The space complexity for the above solution is O(N).
There are multiple sub-sections in this round related to the English communication assessment. This round contains questions related to:
This is a technical and HR interview round.
Tip 1: Be specific with your answers.
Tip 2: Review concepts related to your project.
Tip 3: Review JavaScript concepts.
Explain the event bubbling in JS. (Learn)
Explain OOP in detail. (Learn)
What are your strengths and weaknesses?
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you select an element by class name in CSS?