9 v2

Author: OfficialCodeVoyage

125_Valid Palindrome/sol2.py

@@ -0,0 +1,28 @@
+# Input: s = "A man, a plan, a canal: Panama"
+# Output: true
+# Explanation: "amanaplanacanalpanama" is a palindrome.
+
+
+s = "A man, a plan, a canal: Panama"
+
+def pol(string):
+    ar = ''
+
+    for i in string:
+        if i.isalpha() or i.isnumeric():
+            ar += i.lower()
+
+    print(ar)
+
+    po1, po2 = 0, len(ar) - 1
+
+    while po1 < po2:
+        if ar[po1] == ar[po2]:
+            po1 += 1
+            po2 -= 1
+        else:
+            return False
+    return True
+
+
+print(pol(s))

9_Palindrome Number/v2.py

@@ -0,0 +1,32 @@
+#Example 1:
+#
+# Input: x = 121
+# Output: true
+# Explanation: 121 reads as 121 from left to right and from right to left.
+# Example 2:
+
+x = 121
+
+
+
+def polindrome(number) -> bool:
+    if number < 0:
+        return False
+    elif 0 < number < 10:
+        return False
+
+    l_number = [i for i in str(number)]
+
+
+    po1, po2 = 0, len(l_number) - 1
+
+    while po1 < po2:
+        if l_number[po1] == l_number[po2]:
+            po1 +=1
+            po2 -=1
+        else:
+            return False
+    return True
+
+
+print(polindrome(x))

RAG/rag_schema.py

@@ -0,0 +1,37 @@
+import matplotlib.pyplot as plt
+import matplotlib.patches as mpatches
+
+# Create figure and axis
+fig, ax = plt.subplots(figsize=(10, 8))
+
+# Remove the axis
+ax.axis('off')
+
+# Define box properties
+box_style = dict(boxstyle="round,pad=0.3", edgecolor="black", facecolor="lightblue")
+
+# Define the positions of the boxes
+positions = {
+    "User Query": (0.5, 0.9),
+    "Retriever": (0.5, 0.75),
+    "Retriever Embeds Query": (0.5, 0.6),
+    "Search Documents/Chunks": (0.5, 0.45),
+    "Retrieve Top-K Relevant Chunks": (0.5, 0.3),
+    "Pass Chunks to Generator": (0.5, 0.15),
+    "Generate Final Response": (0.5, 0.05)
+}
+
+# Create the boxes
+for text, pos in positions.items():
+    ax.text(pos[0], pos[1], text, ha="center", va="center", bbox=box_style, fontsize=12)
+
+# Create the arrows
+arrow_props = dict(facecolor='black', shrink=0.05)
+for i in range(len(positions) - 1):
+    start_pos = list(positions.values())[i]
+    end_pos = list(positions.values())[i + 1]
+    ax.annotate('', xy=end_pos, xytext=start_pos, arrowprops=dict(arrowstyle="->", lw=1.5))
+
+# Display the flowchart
+plt.title("Flowchart for RAG Model", fontsize=14)
+plt.show()

hacker_rank/lc.py

@@ -0,0 +1,135 @@
+# ###1
+# if __name__ == '__main__':
+#     # x = int(input())
+#     # y = int(input())
+#     # z = int(input())
+#     # n = int(input())
+#
+#     ## all cases
+#     def all_cases(x=1, y=1, z=2) -> []:
+#         all_cases = []
+#
+#         cases = [[i,j,k] for i in range(0,x+1) for j in range(0, y+1) for k in range(0,z+1)]
+#         return cases
+#
+#
+#     ## cases where it's not equal to n
+#
+#     def equal_cases(cases, n=3):
+#         equal_cases = [i for i in cases if i[1]+i[2]+i[0]==n]
+#
+#
+#         return equal_cases
+#
+#
+#     # print(equal_cases(all_cases(x, y, z), 3))
+#     print(equal_cases(all_cases()))
+
+#2 second lowest
+
+
+# students = [['Harry', 37.21], ['Berry', 37.21], ['Tina', 37.2], ['Akriti', 41], ['Harsh', 39]]
+#
+#
+# ### need to print second lowest, if there are 2 grades print them alphabetically
+#
+# highest = students[0][1]
+# runner = float('inf')
+#
+# for i in range(1, len(students)):
+#     if students[i][1] < highest:
+#         runner = highest
+#         highest = students[i][1]
+#     elif students[i][1] < runner and students[i][1] != highest:
+#         runner = students[i][1]
+#
+# print(runner)
+#
+# selected = [i for i in range(0,len(students)) if students[i][1] == runner]
+# ready = []
+#
+# for i in selected:
+#     ready.append(students[i])
+#
+# ready.sort()
+#
+#
+#
+#
+
+###3
+
+string = 'Banana'
+vowels = ['a', 'e', 'i', 'o', 'u']
+consonants = ['b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v', 'w', 'x', 'y', 'z']
+
+
+
+def count_stuart(string):
+    words = []
+
+    for po1 in range(len(string)):
+        if string[po1].lower() in consonants:
+            for po2 in range(po1 + 1, len(string)+ 1):
+                words.append(string[po1:po2])
+
+    score_dict = {word : words.count(word) for word in words}
+    total_points = 0
+
+    for k,v in score_dict.items():
+        total_points += v
+
+    return total_points
+
+def count_kevin(string):
+    words = []
+
+    for po1 in range(len(string)):
+        if string[po1].lower() in vowels:
+            for po2 in range(po1 + 1, len(string) + 1):
+                words.append(string[po1:po2])
+
+    score_dict = {word: words.count(word) for word in words}
+    total_points = 0
+
+    for k, v in score_dict.items():
+        total_points += v
+
+    return total_points
+
+def minion_game(string) -> str:
+    kevin = count_kevin(string)
+    stuart = count_stuart(string)
+    result = ''
+    if kevin > stuart:
+        result = f'Kevin {kevin}'
+    elif stuart > kevin:
+        result = f'Stuart {stuart}'
+    else:
+        result = 'Draw'
+
+    return result
+
+
+print(minion_game(string))
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

internship.py

@@ -0,0 +1,58 @@
+# singly linked list
+from turtledemo.penrose import start
+
+
+class Node:
+    def __init__(self, data):
+        self.data = data
+        self.next = None
+
+class LinkedList:
+    def __init__(self):
+        self.head = None
+
+    def insertion_at_the_beginning(self, data):
+        new_node = Node(data)
+        new_node.next = self.head
+        self.head = new_node
+
+    def insertion_at_the_end(self, data):
+        new_node = Node(data)
+
+        if not self.head:
+            self.head = new_node
+            return
+
+        last_checked = self.head
+
+        while last_checked.next:
+            last_checked = last_checked.next
+
+        last_checked.next = new_node
+
+
+
+    def printing_list(self):
+        if not self.head:
+            print("LList is empty")
+            return
+
+        current_read = self.head
+        while current_read:
+            print(current_read.data, end=" -> ")
+            current_read = current_read.next
+        print("None")
+
+        
+
+
+llist = LinkedList()
+
+llist.printing_list()
+llist.insertion_at_the_beginning(1)
+llist.insertion_at_the_end(10)
+llist.insertion_at_the_beginning(12)
+llist.printing_list()
+
+
+

linkedList_practise.py

@@ -0,0 +1,69 @@
+from debugpy.common.timestamp import current
+
+
+class Node:
+    def __init__(self, hold_value):
+
+        self.data = hold_value ##Data field
+        self.next = None ##next mode
+
+class LinkedList:
+    def __init__(self):
+        self.head = None
+
+    def append(self, data):
+        new_node = Node(data) # calling Node class with passing data
+
+        if self.head is None: # if empty, setting up a head llist
+            self.head = new_node
+        else: ## when the List Isn't Empty
+            last = self.head # We need to find the last node in the list (the one where next is None). So we start at the head (the first node).
+            while last.next: # loop to keep moving to the next node, while not finding None node
+                last = last.next
+            last.next = new_node
+
+    def print(self):
+        current = self.head
+
+        while current:
+            print(current.data, end=" -> ")
+            current = current.next
+        print("None")
+
+    def lenght(self):
+        current = self.head
+        counter = 0
+
+        while current:
+            counter += 1
+            current = current.next
+        return counter
+
+    def searchforvalue(self, value):
+        current = self.head
+
+        while current:
+            if current.data == value:
+                return "Found"
+            else:
+                current = current.next
+        return "Not found"
+
+    def insertatthebeginning(self, value):
+        insert_node = Node(value)
+
+        if self.head is None:
+            self.head = insert_node
+        else:
+            insert_node.next = self.head
+            self.head = insert_node
+
+
+
+
+ll = LinkedList()
+ll.append(5)
+ll.insertatthebeginning(1)
+ll.append(10)
+ll.print()
+