Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Feat: Implemented Hashmap to lesson 13 by Hummad Tanweer #448

Closed
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -1,12 +1,26 @@
package com.codedifferently.lesson13;

import java.util.HashMap;

public class Lesson13 {

/**
* Provide the solution to LeetCode 3146 here:
* https://leetcode.com/problems/permutation-difference-between-two-strings
*/
public int findPermutationDifference(String s, String t) {
return 0;

// var charLocation = new HashMap<Character, Integer>();
htanweer244 marked this conversation as resolved.
Show resolved Hide resolved

HashMap<Character, Integer> map = new HashMap();
int sum = 0;
for (int i = 0; i < s.length(); i++) {
map.putIfAbsent(s.charAt(i), i);
}
for (char key : map.keySet()) {
int indexInt = t.indexOf(Character.toString(key));
sum += Math.abs(s.indexOf(key) - indexInt);
}
return sum;
}
}