The WeakReference class, monitoring memory leak and garbage collection in a Java application

-
Image
 Below is a Stack implementation that uses an internal resizeable array structure.  public class MyStack< T > implements Stack< T > { private static final int CAPACITY = 100 ; private Object[] array ; private int pos = 0 ; public MyStack () { this . array = new Object[ CAPACITY ] ; } @Override public void push ( T item) { if ( pos >= array . length / 2 ) { Object[] newArray = new Object[ pos * 2 ] ; System. arraycopy ( array , 0 , newArray , 0 , array . length ) ; array = newArray ; } array [ pos ++] = item ; } @Override public T pop () { if (isEmpty()) { throw new RuntimeException( "empty stack" ) ; } @SuppressWarnings ( "unchecked" ) T item = ( T ) array [ pos - 1 ] ; pos -= 1 ; return item ; } @Override @SuppressWarnings ( "unchecked" ) public T peek...
Post a Comment

swapLexOrder: Finding lexicographically largest string

-

The following coding question is really amazing:

Given a string str and array of pairs that indicates which indices in the string can be swapped, return the lexicographically largest string that results from doing the allowed swaps. You can swap indices any number of times.

Example

For str = "abdc" and pairs = [[1, 4], [3, 4]], the output should be
swapLexOrder(str, pairs) = "dbca".

By swapping the given indices, you get the strings: "cbda", "cbad", "dbac", "dbca". The lexicographically largest string in this list is "dbca".

Input/Output

  • [execution time limit] 3 seconds (java)

  • [input] string str

    A string consisting only of lowercase English letters.

    Guaranteed constraints:
    1 ≤ str.length ≤ 104.

  • [input] array.array.integer pairs

    An array containing pairs of indices that can be swapped in str (1-based). This means that for each pairs[i], you can swap elements in str that have the indices pairs[i][0] and pairs[i][1].

    Guaranteed constraints:
    0 ≤ pairs.length ≤ 5000,
    pairs[i].length = 2.


Solution: 

Consider indices as vertices.
Connect two vertices with an edge if swapping is allowed between them

Now for each connected component in graph sort the characters represented by the indices(vertex) and place them from highest value to lowest value in those indices.

Result would be a lexicographically largest string.


Example :

"acxrabdz"
Swaps allowed(0 based index) :-
(0,2)(5,7)(2,7),(1,6)

There are two connected components
(0,2,5,7) and (1,6)
Sort (0,2,5,7) values that is a,x,b,z you get zxba place them in respective indices (z->0,x->2,b->5,a->7)
Similarly sort (1,6) -> c,d - > d,c

final output :- "zcxrabca" lexicographically sorted string


Java Implementation: 

import java.util.Arrays;

import java.util.HashMap;

import java.util.Map;


public class Main {


    private int[] connectedComponents;


    String swapLexOrder(String str, int[][] pairs) {


        //Use a union-find algorithm to find connected indexes (components)

        findConnectedComponents(str, pairs);


        //convert implicit connected indexes to map

        Map<Integer, Integer[]> componentsMap = getConnectedComponents();


        for (Integer key : componentsMap.keySet()) {


            Integer[] components = componentsMap.get(key);


            str = sort(str, components);

        }


        return str;

    }


    private void findConnectedComponents(String str, int[][] pairs) {

        connectedComponents = new int[str.length() + 1];

        for (int i = 0; i < connectedComponents.length; i++) {

            connectedComponents[i] = i;

        }


        for (int[] pair : pairs) {

            connect(pair[0], pair[1]);

        }

    }


    public Map<Integer, Integer[]> getConnectedComponents() {


        Map<Integer, Integer[]> map = new HashMap<>();


        for (int i = 0; i < connectedComponents.length; i++) {


            if (map.get(connectedComponents[i]) == null) {

                map.put(connectedComponents[i], new Integer[]{i});

            } else {

                Integer[] value = map.get(connectedComponents[i]);

                Integer[] newValue = Arrays.copyOf(value, value.length + 1);


                newValue[newValue.length - 1] = i;


                map.put(connectedComponents[i], newValue);

            }

        }


        map.remove(0);


        return map;


    }


    private void connect(int a, int b) {


        for (int i = 0; i < connectedComponents.length; i++) {


            if (connectedComponents[i] == connectedComponents[a] && i != a) {

                connectedComponents[i] = connectedComponents[b];

            }

        }


        connectedComponents[a] = connectedComponents[b];

    }


    public String sort(String s, Integer[] connectedIndexes) {


        Integer[] calibratedIndexes = Arrays.copyOf(connectedIndexes, connectedIndexes.length);


        for (int i = 0; i < calibratedIndexes.length; i++) {

            calibratedIndexes[i] -= 1;

        }


        StringBuilder sb = new StringBuilder(s);


        class Item {


            public Item(int index, String value) {

                this.index = index;

                this.value = value;

            }


            int index;

            String value;

        }


        Item[] values = new Item[calibratedIndexes.length];


        for (int i = 0; i < calibratedIndexes.length; i++) {

            values[i] = new Item(calibratedIndexes[i], s.substring(calibratedIndexes[i], calibratedIndexes[i] + 1));

        }


        Arrays.sort(values, (o1, o2) -> o2.value.compareTo(o1.value));


        for (int i = 0; i < values.length; i++) {

            sb.replace(calibratedIndexes[i], calibratedIndexes[i] + 1, values[i].value);

        }


        return sb.toString();

    }


    public static void main(String[] args) {


        String str = "lvvyfrbhgiyexoirhunnuejzhesylojwbyatfkrv";


        String result = new Main().swapLexOrder(str, new int[][]

                {{13, 23},

                        {13, 28},

                        {15, 20},

                        {24, 29},

                        {6, 7},

                        {3, 4},

                        {21, 30},

                        {2, 13},

                        {12, 15},

                        {19, 23},

                        {10, 19},

                        {13, 14},

                        {6, 16},

                        {17, 25},

                        {6, 21},

                        {17, 26},

                        {5, 6},

                        {12, 24}}

        );


        System.out.println(result);

    }

}





Comments

Post a Comment

Popular posts from this blog

Trie Data Structure and Finding Patterns in a Collection of Words

-
Image
 I faced a very hard problem recently about finding substrings based on a collection of patterns.  Example For  words = ["Apple", "Melon", "Orange", "Watermelon"]  and  parts = ["a", "mel", "lon", "el", "An"] , the output should be  findSubstrings(words, parts) = ["Apple", "Me[lon]", "Or[a]nge", "Water[mel]on"] . While  "Watermelon"  contains three substrings from the  parts  array,  "a" ,  "mel" , and  "lon" ,  "mel"  is the longest substring that appears first in the string. Note: Number of words and number of parts can be huge! A brute force method or careless usage of Java String methods would make it impossible to handle a large number of words and parts (patterns). Solution Approach Whenever we want to search patterns inside a string, we should think about the Trie data structure:  https://en.wikipedia....
Read more

My Crappy Looking Solution to "Binary Tree Common Ancestor" Problem

-
I was able to solve this problem and make all the tests pass: https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor/problem But I'm not happy with the code, so later I need to refactor the code. Here it is: static Node lca(Node root, int v1, int v2) { ArrayList result = new ArrayList<>(); Node result2 = traverse (root, v1, v2, result); if (result.isEmpty()) return result2; return result.get( 0 ); } private static Node traverse(Node root, int v1, int v2, ArrayList result) { if (!result.isEmpty()) { return result.get( 0 ); } if (root. left == null && root. right == null ) { return root; } if (root. data == v1 || root. data == v2) { return root; } Node node1 = null , node2 = null ; if (root. left != null ) node1 = traverse (root. left , v1, v2, result); if (root. right != null ) node2 = traverse (root. right , v1, v...
Read more

A Graph Application in Java: Using WordNet to Find Outcast Words

-
Image
I'll explain our intent with an example: Let's say we have the following words: horse, zebra, cat, bear, table Which one is the outcast? The table.. But how can a computer system find this? We are talking about the whole English language and any word can be in this list. The number of words in the list can be huge, so the solution should use appropriate data structures and algorithms.  We'll use WordNet which is a graph of English words. It contains the semantic relationships between words and our concern is the "is a" relationship. For our example, we know that horse and cat are both animals. "Table" is not an animal and it is the outcast in this situation. But we even have the ability to tell that horse and zebra is very close. Below is a unit test that shows a high level view of our application in Java: public class OutcastTest {     private WordNet wordNet;     private Outcast outcast;     @Before ...
Read more