loyanhakan Goto Github PK

articubot_one

binary-tree-inorder-traversal-leetcode

Given the root of a binary tree, return the inorder traversal of its nodes' values.

climbingstairs-leetcode

You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

find-the-index-of-the-first-occurence-in-a-string-leetcode

Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

javaodev

Source Files Of Java Lessons's HomeWork-1

kth-missing-positive-number-leetcode

Given an array arr of positive integers sorted in a strictly increasing order, and an integer k. Return the kth positive integer that is missing from this array.

length-of-last-word-leetcode

Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only.

login-system-with-registiration

Created in Java language basic Login-Register system with HashMap.

longest-common-prefix-leetcode

Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "".

maximum-level-sum-of-a-binary-tree-leetcode

Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on. Return the smallest level x such that the sum of all the values of nodes at level x is maximal.

merge-two-sorted-lists-leetcode

You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.

palindrome-number-leetcode

Given an integer x, return true if x is a palindrome , and false otherwise.

plusone-leetcode

You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's. Increment the large integer by one and return the resulting array of digits.

remove-duplicates-from-sorted-array-leetcode

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

remove-duplicates-from-sorted-list--leetcode

Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.

remove-element-leetcode

Given an integer array nums and an integer val, remove all occurrences of val in nums in-place.

roman-to-integer-leetcode

Turning integers from Roman number ınputs.

same-tree-leetcode

Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.

search-inderst-position-leetcode

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

sort-an-array-leetcode

Given an array of integers nums, sort the array in ascending order and return it.

spiral-matrix-ii-leetcode

Given a positive integer n, generate an n x n matrix filled with elements from 1 to n2 in spiral order.

symmetric-tree-leetcode

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

twosum-leetcode

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

uncrossed-lines-leetcode

I learned Iterative Dynamic Programming on spesifically in the context of this LeetCode problem. It was like a light bulb going off in my mind.

valid-parentheses-leetcode

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order. Every close bracket has a corresponding open bracket of the same type.