Kotlin Language Features Related to Null Handling

-
Any software engineer with a Java background would find the null handling features in the Kotlin language interesting. Let's summarize this topic with some examples. Nullable types: In Kotlin, types are non-nullable by default. If you want a variable to be able to hold a null value, you need to explicitly declare its type as nullable using the Type? syntax. For example, String? denotes a nullable string, while String represents a non-nullable string. Safe calls (?.): Kotlin introduces the safe call operator (?.) for handling nullable types. It allows you to safely invoke a method or access a property on a nullable object. If the object is null, the expression returns null instead of throwing a NullPointerException. Example: data class Person(val name: String, val age: Int, val address: String?) fun main() {     // Create a person with a nullable address     val person1 = Person("John Doe", 25, "123 Main Street")     val person2 = Person("Jane Doe", 30,...
Post a Comment

Trie Data Structure and Finding Patterns in a Collection of Words

-

 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.org/wiki/Trie

In computer science, a trie, also called prefix tree, is a type of search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters.



public class TrieST<Value> {

    private static final int R = 256;

    private Node root;

    private int n;

    public static class Node {

        public Object val;

        public Node[] next = new Node[R];

    }

    public void put(String key, Value val) {

        if (key == null) throw new IllegalArgumentException("first argument to put() is null");

        else setRoot(put(getRoot(), key, val, 0));

    }


    private Node put(Node x, String key, Value val, int d) {

        if (x == null) x = new Node();

        if (d == key.length()) {

            if (x.val == null) n++;

            x.val = val;

            return x;

        }

        char c = key.charAt(d);

        x.next[c] = put(x.next[c], key, val, d+1);

        return x;

    }


    public Node getRoot() {

        return root;

    }


    public void setRoot(Node root) {

        this.root = root;

    }

}


Figuring out how to use this data structure to find patterns in a collection of words is a good exercise. The idea is handling them word by word of course. And we need a for loop based on each character in the word. This loop should also traverse the Trie structure and while doing that we need to keep track of the matches we found. Note that the values inside the trie represents the parts. 


Comments

Post a Comment

Popular posts from this blog

Virtual Memory

-
The main memory can act as a “cache” for the secondary storage, usually implemented with magnetic disks. This technique is called virtual memory. There were two major motivations for virtual memory: to allow efficient and safe sharing of memory among multiple programs, and to remove the programming burdens of a small, limited amount of main memory. Lets consider a collection of programs running all at once on a computer. Of course, to allow multiple programs to share the same memory, we must be able to protect the programs from each other, ensuring that a program can only read and write the portions of main memory that have been assigned to it. Main memory need contain only the active portions of the many programs, just as a cache contains only the active portion of one program. Virtual memory allows us to efficiently share the processor as well as the main memory. We cannot know which programs will share the memory with other programs when we compile them. In fact, the programs s...
Read more

NOTES ON COMPUTER ARCHITECTURE: Some important concepts in computer architecture

-
A  virtual address  is a binary number in virtual memory that enables a process to use a location in primary storage (main memory) independently of other processes and to use more space than actually exists in primary storage by temporarily relegating some contents to a hard disk or internal flash drive. In a computer that incorporates memory management, the virtual address differs from the  physical address , which is the data location on an address bus that corresponds to a particular cell of primary storage or to a particular register in a memory-mapped I/O(input/output)  device. In a computer with both physical and virtual memory, a so-called  MMU (memory management unit)  coordinates and controls all of the memory resources, assigning portions called blocks to various running programs to optimize system performance. By translating between virtual add...
Read more