• num = 17
• if num < 2:
• print(“Not Prime”)
• else:
• for i in range(2, int(num ** 0.5) + 1):
• if num % i == 0:
• print(“Not Prime”)
• break
• else:
• print(“Prime”)

• num = 121
• reverse = int(str(num)[::-1])
• if num == reverse:
• print(“Palindrome”)
• else:
• print(“Not Palindrome”)

• num = 153
• digits = str(num)
• power = len(digits)
• total = sum(int(digit) ** power for digit in digits)
• if total == num:
• print(“Armstrong Number”)
• else:
• print(“Not Armstrong Number”)

• num = 28
• total = 0
• for i in range(1, num):
• if num % i == 0:
• total += i
• if total == num:
• print(“Perfect Number”)
• else:
• print(“Not Perfect Number”)

• num = 145
• total = 0
• for digit in str(num):
• factorial = 1
• for i in range(1, int(digit) + 1):
• factorial *= i
• total += factorial
• if total == num:
• print(“Strong Number”)
• else:
• print(“Not Strong Number”)

• num = 5
• factorial = 1
• for i in range(1, num + 1):
• factorial *= i
• print(“Factorial =”, factorial)

• n = 10
• a = 0
• b = 1
• for i in range(n):
• print(a, end=” “)
• a, b = b, a + b

• text = “Capgemini”
• reversed_text = text[::-1]
• print(“Reversed String:”, reversed_text)

• text = “madam”
• if text == text[::-1]:
•    print(“Palindrome”)
• else:
•    print(“Not Palindrome”)

• text = “capgemini”
• vowels = 0
• consonants = 0
• for ch in text.lower():
•    if ch.isalpha():
•       if ch in “aeiou”:
•          vowels += 1
•       else:
•          consonants += 1
• print(“Vowels:”, vowels)
• print(“Consonants:”, consonants)

• text = “programming”
• frequency = {}
• for ch in text:
•    if ch in frequency:
•       frequency[ch] += 1
•    else:
•       frequency[ch] = 1
• print(frequency)

• text = “programming”
• result = “”
• for ch in text:
•    if ch not in result:
•       result += ch
• print(“String Without Duplicates:”, result)

• text1 = “listen”
• text2 = “silent”
• if sorted(text1) == sorted(text2):
•    print(“Anagram”)
• else:
•    print(“Not Anagram”)

• text = “swiss”
• for ch in text:
•    if text.count(ch) == 1:
•       print(“First Non-Repeated Character:”, ch)
•       break

• text = “Welcome To Capgemini”
• words = text.split()
• count = len(words)
• print(“Number Of Words:”, count)

• text = “I Love Coding”
• words = text.split()
• reversed_words = words[::-1]
• result = ” “.join(reversed_words)
• print(“Reversed Words:”, result)

• text = “123456”
• if text.isdigit():
•    print(“Contains Only Digits”)
• else:
•    print(“Contains Non-Digit Characters”)

• numbers = [10, 25, 5, 40, 15]
• maximum = numbers[0]
• minimum = numbers[0]
• for number in numbers:
• if number > maximum:
• maximum = number
• if number < minimum:
• minimum = number
• print(“Maximum:”, maximum)
• print(“Minimum:”, minimum)

• numbers = [10, 25, 5, 40, 15]
• largest = second = float(‘-inf’)
• for number in numbers:
• if number > largest:
• second = largest
• largest = number
• elif number > second and number != largest:
• second = number
• print(“Second Largest:”, second)

• numbers = [40, 10, 30, 20, 50]
• for i in range(len(numbers)):
• for j in range(i + 1, len(numbers)):
• if numbers[i] > numbers[j]:
• numbers[i], numbers[j] = numbers[j], numbers[i]
• print(“Sorted Array:”, numbers)

• numbers = [10, 20, 10, 30, 20, 40]
• unique = []
• for number in numbers:
• if number not in unique:
• unique.append(number)
• print(“Array After Removing Duplicates:”, unique)

• numbers = [10, 20, 10, 30, 20, 40]
• duplicates = []
• for number in numbers:
• if numbers.count(number) > 1 and number not in duplicates:
• duplicates.append(number)
• print(“Duplicate Elements:”, duplicates)

• numbers = [1, 2, 4, 5, 6]
• n = 6
• total = n * (n + 1) // 2
• array_sum = sum(numbers)
• missing = total – array_sum
• print(“Missing Number:”, missing)

27. How Does Find Pairs With A Given Sum?

Ans:

28. How Does Rotate An Array?

Ans:

29. How Does Merge Two Arrays?

Ans:

30. How Does Find The Sum Of All Elements In An Array?

Ans:

31. How Does Print A Number Pattern?

Ans:

32. How Does Print A Pyramid Pattern

Ans:

33. How Does Print An Inverted Pyramid Pattern?

Ans:

34. How Does Print A Diamond Pattern?

Ans:

35. How Does Print A Character Pattern?

Ans:

36. How Does Find Factorial Using Recursion?

Ans:

37. How Does Generate Fibonacci Series Using Recursion?

Ans:

38. How Does Find The Sum Of Natural Numbers?

Ans:

39. How Does Reverse A String Using Recursion?

Ans:

40. How Does Calculate Power Using Recursion?

Ans:

41. How Does Traverse An Array?

Ans:

42. How Does Find The Largest Element In An Array?

Ans:

43. How Does Reverse A Linked List?

Ans:

44. How Does Implement A Stack Using A List?

Ans:

45. How Does Implement A Queue Using A List?

Ans:

46. How Does Count Frequency Of Elements Using Hashing?

Ans:

.

47. How Does Insert A Node Into A Binary Tree?

Ans:

48. How Does Perform Breadth-First Search In A Graph?

Ans:

49. What Is A Class And Object?

Ans:

A class is a blueprint or template used to define the properties and behaviors of objects. It can contain variables, methods, constructors, and other members required to represent an entity. An object is an instance of a class created during program execution. Multiple objects can be created from the same class, with each object maintaining its own data. For example, a Car class can define properties such as color and model and methods such as start(). A particular car created from the Car class becomes an object.

50. What Is Encapsulation?

Ans:

Encapsulation is an object-oriented programming concept that combines data and methods within a single class. It also helps restrict direct access to internal data by using access control mechanisms. Private variables can be accessed or modified through public methods such as getters and setters. This approach protects data from unwanted or incorrect modifications. Encapsulation improves security, maintainability, and code organization. For example, a bank account can keep its balance private and provide methods for deposit and withdrawal.

51. What Is Inheritance?

Ans:

Inheritance allows one class to acquire properties and methods from another class. The existing class is commonly called the parent or superclass, while the new class is called the child or subclass. Inheritance promotes code reuse and reduces duplicate implementation. A child class can also add new properties and methods or modify inherited behavior. For example, a Dog class can inherit common features from an Animal class. Inheritance is an important concept for creating relationships between related classes.

52. What Is Polymorphism?

Ans:

Polymorphism means the ability of an object or method to take different forms. It allows the same method name or interface to perform different operations depending on the object or input. Method overriding is an example of runtime polymorphism, where a child class provides its own implementation of a parent method. Method overloading is commonly associated with compile-time polymorphism in languages that support it. Polymorphism improves flexibility and allows common interfaces to work with different implementations. For example, different animal classes can implement the same sound() method differently.

53. What Is Abstraction?

Ans:

Abstraction is the process of hiding unnecessary implementation details and exposing only the essential functionality. It helps users interact with an object without needing to understand its internal working. Abstract classes and interfaces are commonly used to implement abstraction. For example, a user can call a withdraw() method without knowing how the banking system internally processes the transaction. Abstraction reduces complexity and improves code organization. It also allows implementation details to change without significantly affecting users of the functionality.

54. What Is A Constructor?

Ans:

A constructor is a special method used to initialize an object when it is created. It is automatically called during object creation in languages such as Java and C++. Constructors can initialize instance variables with default or user-provided values. A class can have different forms of constructors depending on the programming language. In Python, the __init__() method is commonly used for object initialization. Constructors help ensure that objects begin with valid and meaningful data.

55. What Is The Difference Between Method Overloading And Method Overriding?

Ans:

Feature	Method Overloading	Method Overriding
Meaning	Same method name with different parameters in the same class.	Child class provides a different implementation of a parent class method.
Parameters	Parameters must differ in number, type, or order.	Parameters generally remain the same.
Purpose	Provides multiple ways to perform a similar operation.	Allows a child class to customize inherited behavior.

56. What Is A SELECT Query In SQL?

Ans:

A SELECT query is used to retrieve data from one or more tables in a database. It allows specific columns or all columns to be selected based on the requirement. The SELECT keyword specifies the columns that need to be displayed. The FROM keyword identifies the table from which the data should be retrieved. Additional clauses such as WHERE, GROUP BY, and ORDER BY can be used with SELECT queries. SELECT queries are commonly used for reading and analyzing database information.

57. What Is The Difference Between WHERE And HAVING?

Ans:

The WHERE clause is used to filter individual records before grouping or aggregation takes place. The HAVING clause is used to filter grouped results after aggregation. WHERE can be used with normal column conditions and does not normally work directly with aggregate results. HAVING is commonly used with aggregate functions such as COUNT, SUM, and AVG. For example, WHERE salary > 30000 filters employees before grouping. HAVING COUNT(*) > 5 filters groups containing more than five records.

58. What Is GROUP BY In SQL?

Ans:

The GROUP BY clause is used to group rows that have the same values in one or more columns. It is commonly used with aggregate functions such as COUNT, SUM, AVG, MIN, and MAX. For example, employees can be grouped based on their department. An aggregate function can then calculate the number of employees in each department. GROUP BY is useful for generating summary reports and analyzing data. The grouped results can also be filtered using the HAVING clause.

59. What Is ORDER BY In SQL?

Ans:

The ORDER BY clause is used to arrange query results in a specific order. By default, sorting is performed in ascending order using ASC. The DESC keyword can be used when descending order is required. Multiple columns can also be included in an ORDER BY clause. For example, employees can be sorted first by department and then by salary. ORDER BY is useful when results need to be displayed in a meaningful or ranked sequence.

60. What Is A JOIN In SQL?

Ans:

A JOIN is used to combine data from two or more tables based on a related column. Common JOIN types include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL OUTER JOIN. An INNER JOIN returns only records that have matching values in both tables. A LEFT JOIN returns all records from the left table and matching records from the right table. JOINs are widely used in relational databases to retrieve related information stored across multiple tables.

61. What Is An INNER JOIN?

Ans:

An INNER JOIN returns only the records that have matching values in both tables. It requires a common or related column between the tables. For example, an employee table can be joined with a department table using department ID. Employees whose department ID does not have a matching department record will not appear. INNER JOIN is useful when only matching records are required. It is one of the most frequently used JOIN types in SQL.

62. What Is A Subquery In SQL?

Ans:

• A subquery is a query written inside another SQL query. It is commonly used when the result of one query is required as input for another query. 
• A subquery can be placed inside clauses such as WHERE, FROM, or SELECT. For example, a subquery can find the average salary and the outer query can find employees earning more than that average. 
• Subqueries help solve complex database problems in smaller logical steps. They can also be replaced by JOINs or common table expressions in suitable situations.

63. What Are Aggregate Functions In SQL?

Ans:

Aggregate functions perform calculations on multiple rows and return a single result or grouped results. Common aggregate functions include COUNT, SUM, AVG, MIN, and MAX. COUNT calculates the number of records, while SUM calculates the total of numeric values. AVG calculates the average, and MIN and MAX find the smallest and largest values. Aggregate functions are frequently combined with GROUP BY. They are useful for generating summaries and reports from database tables.

64. How Does Find Duplicate Records In SQL?

Ans:

Duplicate records can be identified by grouping records based on the columns that should be unique. The GROUP BY clause groups records having identical values. The COUNT() function can then determine how many times each combination occurs. The HAVING COUNT(*) > 1 condition returns only groups containing duplicates. For example, duplicate email addresses can be found by grouping records based on the email column. This technique is commonly used for checking data quality and identifying repeated records.

65. How Does Find The Second-Highest Salary In SQL?

Ans:

The second-highest salary can be found using different SQL techniques. One common approach is to use a subquery that finds the maximum salary below the highest salary. Another approach uses DENSE_RANK() to rank salaries and select the records having rank two. DISTINCT may be required when multiple employees have the same salary. The query should also handle cases where duplicate salary values exist. This is a common SQL interview question because it tests sorting, filtering, subqueries, and ranking concepts.

66. What Is Big O Notation?

Ans:

Big O notation is used to describe the time or space complexity of an algorithm. It explains how the resource requirements of an algorithm grow as the input size increases. Common complexities include O(1), O(log n), O(n), O(n log n), and O(n²). O(1) represents constant complexity, while O(n) represents linear growth with the input size. Big O mainly focuses on the growth rate and ignores constant factors and smaller terms. It is useful for comparing algorithms and selecting efficient solutions.

67. What Are Best, Average, And Worst Cases?

Ans:

Best case represents the minimum amount of work an algorithm performs for a particular input. Average case represents the expected performance across typical or randomly distributed inputs. Worst case represents the maximum amount of work required for an input. For example, linear search has O(1) best-case complexity when the target is the first element. Its average and worst-case complexities are generally O(n). Understanding these cases helps evaluate an algorithm’s performance under different input conditions.

68. What Is The Time Complexity Of Common Array Operations?

Ans:

Accessing an array element by index generally takes O(1) time because the memory location can be calculated directly. Searching for an unsorted element using linear search takes O(n) time. Inserting or deleting an element at the beginning or middle can take O(n) because other elements may need to be shifted. Adding an element at the end of a dynamic array is usually O(1) amortized. Traversing all elements requires O(n) time. Understanding these complexities helps select suitable data structures for different operations.

69. What Is The Time Complexity Of Searching Algorithms?

Ans:

• Linear search examines elements one by one and has O(n) worst-case time complexity. Its best case is O(1) when the target is the first element. Binary search works on sorted data by repeatedly dividing the search range into two parts. 
• Binary search has O(log n) worst-case time complexity. Hash-table lookup is generally O(1) on average but can degrade to O(n) in unfavorable collision scenarios. 
• Choosing the appropriate search algorithm depends on data organization and whether the data is sorted.

70. What Is The Time Complexity Of Sorting Algorithms?

Ans:

Bubble sort, selection sort, and insertion sort generally have O(n²) worst-case time complexity. Merge sort has O(n log n) time complexity in the best, average, and worst cases. Quick sort has an average complexity of O(n log n), while its worst case can be O(n²) with poor pivot selection. Efficient sorting is important when working with large datasets. The choice of sorting algorithm depends on factors such as input size, memory usage, stability, and data characteristics.

71. How Can Inefficient Code Be Optimized?

Ans:

Inefficient code can be optimized by first identifying the part of the program responsible for excessive execution time or memory usage. Nested loops should be examined because unnecessary nested iterations can increase complexity significantly. Appropriate data structures such as hash maps or sets can replace repeated searches through arrays. Repeated calculations can be stored and reused instead of being recalculated. Algorithms with better complexity should be selected when possible, such as binary search instead of linear search for sorted data. Optimization should preserve correctness while improving performance and resource utilization.

72. How Does Solve A Simple Counting Problem?

Ans:

73. How Does Solve An Age Calculation Problem?

Ans:

74. How Does Calculate A Percentage?

Ans:

75. How Does Calculate Profit And Loss?

Ans:

76. How Does Calculate The Profit Percentage?

Ans:

77. How Does Calculate The Loss Percentage?

Ans:

78. How Does Find The Sum Of Natural Numbers?

Ans:

79. How Does Check Whether A Number Is Even Or Odd?

Ans:

80. How Does Find The Average Of Numbers?

Ans:

81. How Does Find The Greatest Of Three Numbers?

Ans:

82. How Does Find The Smallest Of Three Numbers?

Ans:

83. How Does Check Whether A Number Is Divisible By Another Number?

Ans:

84. How Does Calculate Simple Interest?

Ans:

85. How Does Calculate Compound Interest?

Ans:

86. How Does Find The Factorial Of A Number?

Ans:

87. How Does Find The GCD Of Two Numbers?

Ans:

88. How Does Find The LCM Of Two Numbers?

Ans:

89. How Does Check Whether A Number Is A Perfect Number?

Ans:

90. How Does Solve A Basic Logical Puzzle Using Two Numbers?

Ans: