Mithra Talluri MithraTalluri

Standing on the shoulders of giants

MithraTalluri / NamedArguments.kt

Created September 18, 2019 07:56

buildRectangle(title = "MyRectangle", width = 50)

MithraTalluri / DefaultArguments.kt

Created September 18, 2019 07:53

	fun buildRectangle(title: String, height: Int = 100, width: Int = 100) {
	Rectangle(title, width, height)
	}

MithraTalluri / Null Safety In Kotlin

Last active September 18, 2019 07:25

	val str1: String = null // compile time error
	val str2: String? = null // compiles fine

	val handler: EmailHandler? = null
	handler.sendEmail() // compile time error
	handler?.sendEmail() // compiles fine but doesn't call sendEmail() function

MithraTalluri / Person.kt

Created September 18, 2019 07:10

data class Person(val name: String, val age: Int)

MithraTalluri / Person.java

Created September 18, 2019 07:09

	public class Person {
	private final String name;
	private final int age;

	public Person(String name, int age) {
	this.name = name;
	this.age = age;
	}

	public String getName() {

MithraTalluri / lastChar.kt

Last active September 18, 2019 07:02

	fun String.lastChar() = get(length - 1) //returns the last char in a string
	val lastChar: Char = "abcd".lastChar() // d

MithraTalluri / Equality checks in Kotlin

Created September 18, 2019 06:39

	val john1 = Person("John")
	val john2 = Person("John")
	john1 == john2 // true (structural equality)
	john1 === john2 // false (referential equality)

MithraTalluri / Smart casts in Kotlin

Created September 18, 2019 06:31

	if (obj is String) {
	print(obj.length) // x is automatically cast to String
	}

	if (obj !is String) {
	print("Not a String")
	}

MithraTalluri / Type Inference in Kotlin

Created September 18, 2019 06:17

	val i = 1 // type inferred to Int
	val s = "abc" // type inferred to String

	val j: Double = 1.1 // type declared explicitly

MithraTalluri / ManachersAlgorithmSnippet.java

Created July 6, 2019 22:51

Manacher's Algorithm

	int manachersAlgorithm(String s, int N) {
	String str = getModifiedString(s, N);
	int len = (2 * N) + 1;
	int[] P = new int[len];
	int c = 0; //stores the center of the longest palindromic substring until now
	int r = 0; //stores the right boundary of the longest palindromic substring until now
	int maxLen = 0;
	for(int i = 0; i < len; i++) {
	//get mirror index of i
	int mirror = (2 * c) - i;