Cognizant communication

1. Reading Section (23 questions) – You need to read the given sentences.

2. Speaking Section (4 questions) – You'll be given a topic and need to speak about it for 1 minute.


3. Fill in the Blanks (34 questions) – Standard fill-in-the-blank questions.


4. Listening Section (16 questions) – You'll listen to a 4-minute audio and answer the remaining questions based on it.

Total: 77 questions in 58 minutes

CRTD scam......

https://www.linkedin.com/posts/appsite-masters-43759a323_crtd-scam-hiringscam-activity-7263724821786607616-ptJk?utm_source=share&utm_medium=member_android&rcm=ACoAAEe6qQoBTcr0G-hFjKVyaVXK68xSpkfKYI8

Medplus sending hall ticket 🎟️....


Best of luck 🤞❤️

import sys
sys.setrecursionlimit(1_000_000)

class DirNode:
    def __init__(self, name):
        self.name = name
        self.children = {}
        self.parent = None

class DirectoryTree:
    def __init__(self):
        self.root = DirNode("root")
        self.total_nodes = 1
        self.MAX_NODES = 10**6
        self.path_map = {"root": self.root}

    def get_node(self, path):
        return self.path_map.get(path, None)

    def build_path(self, parent_path, child_name):
        return parent_path + "/" + child_name

    def add_node(self, parent_path, *child_names):
        parent = self.get_node(parent_path)
        if not parent:
            return
        for name in child_names:
            if name not in parent.children:
                new_node = DirNode(name)
                new_node.parent = parent
                parent.children[name] = new_node
                full_path = self.build_path(parent_path, name)
                self.path_map[full_path] = new_node
                self.total_nodes += 1

    def count_descendants(self, path):
        node = self.get_node(path)
        if not node:
            print("Invalid command")
            return

        def dfs(n):
            count = 0
            for cname, ch in n.children.items():
                count += 1 + dfs(ch)
            return count

        print(dfs(node))

    def cut_paste(self, src_path, dst_path):
        src = self.get_node(src_path)
        dst = self.get_node(dst_path)

        if not src or not dst or src is self.root or src.name in dst.children:
            print("Invalid command")
            return

        # Remove old paths
        def remove_paths(n, current_path):
            self.path_map.pop(current_path, None)
            for cname, ch in n.children.items():
                remove_paths(ch, self.build_path(current_path, cname))

        remove_paths(src, src_path)

        # Detach from old parent
        del src.parent.children[src.name]

        # Attach to new parent
        src.parent = dst
        dst.children[src.name] = src

        # Add new paths
        def add_paths(n, current_path):
            self.path_map[current_path] = n
            for cname, ch in n.children.items():
                add_paths(ch, self.build_path(current_path, cname))

        new_path = self.build_path(dst_path, src.name)
        add_paths(src, new_path)

        print("OK")

    def copy_paste(self, src_path, dst_path):
        src = self.get_node(src_path)
        dst = self.get_node(dst_path)

        if not src or not dst or src.name in dst.children:
            print("Invalid command")
            return

        # Count number of nodes to be added
        def count_nodes(n):
            cnt = 1
            for ch in n.children.values():
                cnt += count_nodes(ch)
            return cnt

        needed = count_nodes(src)
        if self.total_nodes + needed > self.MAX_NODES:
            print("Invalid command")
            return

        # Clone subtree
        def clone(n):
            copy = DirNode(n.name)
            for cname, ch in n.children.items():
                child_copy = clone(ch)
                child_copy.parent = copy
                copy.children[cname] = child_copy
            return copy

        new_subtree = clone(src)
        new_subtree.parent = dst
        dst.children[new_subtree.name] = new_subtree

        # Add new paths to map
        def add_paths(n, current_path):
            self.path_map[current_path] = n
            for cname, ch in n.children.items():
                add_paths(ch, self.build_path(current_path, cname))

        new_path = self.build_path(dst_path, src.name)
        add_paths(new_subtree, new_path)

        self.total_nodes += needed
        print("OK")

Part -1