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...
I am a software engineer with experience in developing web applications and mobile apps.
I have a degree in Computer Science
I have worked with Java, Python, and JavaScript
I have experience with front-end frameworks like React and Angular
I have developed mobile apps using React Native
I am familiar with Agile methodologies
I have a passion for software development and enjoy the challenges it presents.
I have always been interested in technology and programming
I have taken courses and completed projects in software development
I enjoy problem-solving and finding efficient solutions
I believe software engineering is a constantly evolving field with endless opportunities for growth
A program to check if a given number is prime or not.
A prime number is a number that is only divisible by 1 and itself.
Start checking from 2 up to the square root of the number.
If the number is divisible by any number in the range, it is not prime.
Otherwise, it is prime.
Optimization: check only odd numbers after 2.
Fibonacci program generates a series of numbers where each number is the sum of the two preceding ones.
The program can be implemented using recursion or iteration.
The first two numbers in the series are always 0 and 1.
The next number is the sum of the previous two numbers.
Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418,...
Flowchart for two programs
Identify inputs and outputs
Determine program logic
Create decision points and loops
Connect program components
Include error handling
Test and debug
Document the flowchart
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