yaseen12273 Goto Github PK

-guess-number-higher-or-lower

We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I'll tell you whether the number is higher or lower. You call a pre-defined API guess(int num) which returns 3 possible results (-1, 1, or 0): -1 : My number is lower 1 : My number is higher 0 : Congrats! You got it!

-power-of-two

Given an integer n, write a function to determine if it is a power of two.

array-contain-duplicates

given an array return true if there is any duplicates otherwise return false.

array-containduicates-in-c-

given an array of integers of array find if array contain duplicates. return true if there is duplicate otherwise false.

best-time-to-buy-and-sell-stock-ii

Say you have an array prices for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).

binary-search

Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If target exists, then return its index, otherwise return -1.

computer_systems_design

detect-capital

Given a word, you need to judge whether the usage of capitals in it is right or not.

fibonacci-number

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, F(0) = 0, F(1) = 1 F(N) = F(N - 1) + F(N - 2), for N > 1. Given N, calculate F(N)

first-bad-version

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad. Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad. You are given an API bool isBadVersion(version) which will return whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

icodeguru

Python course for absolute beginners

is-subsequence

Given a string s and a string t, check if s is subsequence of t. A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ace" is a subsequence of "abcde" while "aec" is not).

majority-element

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array

merge-two-binary-trees

Share Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.

middle-of-link-list-in-c-

the code tells about how we can find middle of the link list using two pointers techniques. this is a c++ solution

move-zeroes-in-c-

in this solution we are moving zeroes on one side of the array by maintaining the relative order of non zero elements.

number-of-1-bits

Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight).

peak-index-in-a-mountain-array

remove-duplicate-from-sorted-list

this is leetcode problem

remove-link-list-element

Remove all elements from a linked list of integers that have value val.

reverse-string-in-cpp

in this question we will reverse a string

same-tree

Given two binary trees, 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-insert-position

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.

season-of-docs

Supporting materials for Google's Season of Docs 2021

sqrt-x-

Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned

valid-perfect-square

Given a positive integer num, write a function which returns True if num is a perfect square else False. Follow up: Do not use any built-in library function such as sqrt.

yaseen12273

Config files for my GitHub profile.