Filter interviews by
Be the first one to contribute and help others!
I know multiple programming languages including Java, Python, and C++.
Proficient in Java with experience in developing web applications using Spring framework
Familiar with Python for data analysis and machine learning
Experience in C++ for developing high-performance applications
Also familiar with HTML, CSS, and JavaScript for front-end development
Class is a blueprint for creating objects, encapsulation is the process of hiding data and methods within a class.
Class is a template or blueprint that defines the properties and behaviors of an object.
Encapsulation is the process of bundling data and methods together within a class, hiding the internal details from the outside world.
Other features of OOP include inheritance, polymorphism, and abstraction.
Inheritance a...
Program to find the sum of squares of each term of Fibonacci series
Generate Fibonacci series using loop or recursion
Calculate square of each term
Add all squares to get the sum
I would like to join Cognizant because of its reputation as a leading global technology and consulting company.
Cognizant has a strong presence in the industry and is known for its innovative solutions.
I am impressed by Cognizant's commitment to digital transformation and its ability to deliver value to clients.
The company offers excellent career growth opportunities and a supportive work environment.
Cognizant's diverse...
Polymorphism is the ability of an object to take on many forms. In C++, it is achieved through function overloading and virtual functions.
Polymorphism allows objects of different classes to be treated as objects of a common base class.
Function overloading enables multiple functions with the same name but different parameters.
Virtual functions allow derived classes to override base class functions.
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 4 reviews
Rating in categories
TCS
Accenture
Wipro
Cognizant