Filter interviews by
Be the first one to contribute and help others!
I am not currently planning on getting married.
I am currently focused on my career and personal growth.
Marriage is not a priority for me at this time.
I believe in taking the time to find the right person and building a strong foundation before getting married.
Java is an object-oriented language while C is a procedural language.
Java is platform-independent while C is platform-dependent.
Java has automatic garbage collection while C requires manual memory management.
Java has built-in support for multithreading while C requires external libraries.
Java has a larger standard library compared to C.
Java is more secure than C due to its strong type checking and exception handling.
C ...
Pointers are variables that store memory addresses of other variables in programming languages.
Pointers allow direct access and manipulation of memory locations.
They are commonly used in programming languages like C and C++.
Pointers can be used to pass variables by reference, allowing modifications to the original value.
They can also be used to dynamically allocate memory.
Example: int* ptr; // declares a pointer to an
In 5 years, I see myself as a senior software engineer leading a team of developers.
Leading a team of developers
Working on complex projects
Continuing to learn and grow in my role
Contributing to the success of the company
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 1 review
Rating in categories
TCS
Accenture
Wipro
Cognizant