Almanca’da birkaç farklı zaman bulunmaktadır. İşte temel zamanların bir listesi: Präsens (Şimdiki Zaman): Günlük olayları, genel doğruları ve alışkanlıkları ifade etmek için kullanılır. Örneğin: Ich lese ein Buch. (Bir…
Almanca Zamirler
“ich” (ben): “Ich gehe zum Markt.” (Pazara gidiyorum. – Tek bir kişi, kendim.) “Ich habe Hunger.” (Açım. – Tek bir kişi, kendim.) “Ich lese ein Buch.” (Kitap okuyorum. –…
Spring Dependency Injection
Now that we have a good understanding of how to create beans and make sure they get into the the Application Context, let’s have a look at defining relations…
Design Pattern : Dependency Inversion Principle
In object-oriented design, the dependency inversion principle is a specific form of decoupling software modules. When following this principle, the conventional dependency relationships established from high-level, policy-setting modules to…
Design Pattern: interface-segregation principle (ISP)
In the field of software engineering, the interface-segregation principle (ISP) states that no client should be forced to depend on methods it does not use.[1] ISP splits interfaces that…
Design Pattern: Open closed principle with using spesification pattern
In computer programming, the specification pattern is a particular software design pattern, whereby business rules can be recombined by chaining the business rules together using boolean logic. The pattern…
LeetCode: Sorted Array to BST
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is defined as a binary…
LeetCode: Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example:Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 /…
LeetCode: Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 /…
LeetCode: Is valid BST
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only…