thmain

public class Main {

    public static Map<Integer, Integer> ht = new HashMap<>();;

    public static void topView(Node root, int level) {
        if (root == null)
            return;

        Queue<QueuePack> queue = new LinkedList<>();
        queue.add(new QueuePack(level, root));

thmain

import java.util.Arrays;

public class MaxRepeatingUsingSorting {
    public void maxRepeatingElementUsingSorting(int [] arrA){
        if(arrA.length<1){
            System.out.println("Inavlid Array");
            return;
        }
        Arrays.sort(arrA);
        int count=1;

thmain

import java.util.Stack;

public class ReverseDLL {

    static class Node{
        int data;
        Node prev;
        Node  next;

        public Node(int data){

thmain

import java.util.Stack;

public class ReverseLL {

    static class Node {
        int data;
        Node next;

        public Node(int data) {
            this.data = data;

thmain

package main

import "fmt"

func findTwoRepeating(A []int) {
    fmt.Print("Repeated Elements: ")
    for i := 0; i < len(A); i++ {
        for j := i + 1; j < len(A); j++ {
            if A[i] == A[j] {
                fmt.Print(A[i], " ")

thmain

def find_two_repeating(A):
    print("Repeated Elements:")
    for i in range(len(A)):
        for j in range(i + 1, len(A)):
            if A[i] == A[j]:
                print(A[i], end=" ")

if __name__ == "__main__":
    A = [1, 5, 2, 4, 8, 9, 3, 1, 4, 0]
    find_two_repeating(A)

thmain

class MinimumCostStaircaseRecursion:
    def minCost(self, cost):
        stairs = len(cost) - 1
        return self.util(cost, -1, stairs)
    
    def util(self, cost, current, stairs):
        if current == stairs:
            return cost[current]
        
        if current > stairs:

thmain

import java.util.ArrayList;
import java.util.Collections;

public class MaximumMeetingInOneRoom {

    static class Meeting{
        int startTime;
        int endTime;
        String meetingTitle;

thmain

public class MaximumSubArray {
	// Kadane algorithm
	public int kandane(int[] arrA) {
		int current_sum = 0;
		int max_sum = 0;
		for (int i = 0; i < arrA.length; i++) {
			current_sum += arrA[i];
			if (current_sum < 0) {
				current_sum = 0;
			}

thmain

import java.util.HashSet;

public class ColorfulNumbers {

    public boolean isColorful(int number){
        HashSet<Integer> set = new HashSet<>();
        String colorString = String.valueOf(number);
        int length = colorString.length();

        for(int i =  1; i < length; i++){