-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblems.java
More file actions
186 lines (104 loc) · 3.15 KB
/
Copy pathproblems.java
File metadata and controls
186 lines (104 loc) · 3.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
package hashmaps;
import java.util.ArrayList;
import java.util.Map;
import java.util.HashMap;
public class problems {
public static String recurr(int num, int den) {
HashMap<Integer,Integer>mp=new HashMap<>();
int rem=num%den;
String res="";
while(rem!=0 && mp.containsKey(rem)==false){
mp.put(rem,rem);
rem*=10;
res+=(rem/den);
rem=rem%den;
}
return rem==0?"":res;
}
public static String findDif(String str){
String res="";
for(int i=1;i<str.length();i++){
int diff=str.charAt(i)-str.charAt(i-1);
if(diff<0){
diff+=26;
}
res+=(diff+'a');
}
return res;
}
public static void grouping(String[] arr, int n) {
HashMap<String,ArrayList<String> >mp=new HashMap<>();
for(int i=0;i<arr.length;i++){
String diff=findDif(arr[i]);
// System.out.println(diff);
if(mp.containsKey(diff)){
ArrayList<String>temp=mp.get(diff);
temp.add(arr[i]);
mp.put(diff,temp);
}
else{
ArrayList<String>temp=new ArrayList<>();
temp.add(arr[i]);
mp.put(diff,temp);
}
}
for(Map.Entry<String,ArrayList<String> >entry:mp.entrySet()){
ArrayList<String> temp=entry.getValue();
for(int i=0;i<temp.size();i++){
System.out.print(temp.get(i)+" ");
}
System.out.println();
}
}
public static boolean ispairexist(int[] arr, int n, int k) {
if(n%2!=0){
return false;
}
HashMap<Integer,Integer>mp=new HashMap<>();
for(int i=0;i<n;i++){
int mod=arr[i]%k;
if(mp.containsKey(mod)){
mp.put(mod,mp.get(mod)+1);
}
else{
mp.put(mod,1);
}
}
for(int i=0;i<n;i++){
int mod=arr[i]%k;
if(mod==0){
if(mp.get(mod)%2!=0){
return false;
}
}
else if(2*mod==k){
if(mp.get(mod)%2!=0){
return false;
}
}
else{
if(mp.get(k-mod)!=mp.get(mod)){
return false;
}
}
}
return true;
}
public static void itineary(HashMap<String, String> input) {
HashMap<String,String>rev=new HashMap<>();
for(Map.Entry<String,String>entry:input.entrySet()){
rev.put(entry.getValue(),entry.getKey());
}
String start="";
for(Map.Entry<String,String>entry:input.entrySet()){
if(!rev.containsKey(entry.getKey())){
start=entry.getKey();
break;
}
}
while(input.containsKey(start)==true){
System.out.println(start+" -> "+input.get(start));
start=input.get(start);
}
}
}