Codility Series. No 001: Binary GapIf you are not familiar with this exercise, go and check the following URL:Mar 26, 2022Mar 26, 2022
Leetcode Series. No 881: Boats to Save PeopleYou are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a…Mar 24, 2022Mar 24, 2022
Leetcode Series. No 283: Moving ZeroesGiven an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.Mar 9, 20221Mar 9, 20221
Leetcode Series. No 1007: Minimum Domino Rotations For Equal RowIn a row of dominoes, tops[i] and bottoms[i] represent the top and bottom halves of the ith domino. (A domino is a tile with two numbers…Mar 6, 2022Mar 6, 2022
Leetcode Series. No 204: Count PrimesGiven an integer n, return the number of prime numbers that are strictly less than n.Feb 13, 2022Feb 13, 2022
Leetcode Series. No 098: Validate Binary Search TreeGiven a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.Feb 12, 2022Feb 12, 2022
Leetcode Series. No 098: Validate Binary Search TreeGiven the root of a binary tree, determine if it is a valid binary search tree (BST).Feb 11, 2022Feb 11, 2022
Leetcode Series. No 100: Same TreeGiven the roots of two binary trees p and q, write a function to check if they are the same or not.Feb 10, 2022Feb 10, 2022
Leetcode Series. No 102: Binary Tree Level Order TraversalGiven the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).Feb 9, 2022Feb 9, 2022
Leetcode Series. No 104: Maximum Depth of Binary TreeGiven the root of a binary tree, return its maximum depth.Feb 8, 2022Feb 8, 2022
