This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2 | |
3 | |
10 | |
20 | |
30 | |
2 | |
50 | |
100 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2 | |
123 1 | |
489 2 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2 | |
some#important#data | |
gulf$open|programming%contest |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Python3 code to find out minimum cost | |
# path to connect all the cities | |
# Algorithm explanation https://www.geeksforgeeks.org/minimum-cost-connect-cities/ | |
import sys | |
def minKey(n,list,nodes): | |
min = sys.maxsize | |
for i in range(n): | |
if(list[i] < min and nodes[i] == False): | |
min = list[i] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// | |
// main.cpp | |
// dataStructures01 | |
// | |
#include <iostream> | |
int const SIZE =6; | |
int A[SIZE] = {1,2,2,4,5} , N = 5; // what is N?? |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.io.*; | |
public class PalindromeBase { | |
static String number = "";// this string is to store the reminder untill num/base == 0 | |
// I used recursive function | |
public static int calculate(int num , int base){ | |
if(num/base==0){ | |
number += Integer.toString(num%base); | |
return 0; | |
}else{ | |
number += Integer.toString(num%base); |