Open in app

Sign In

Write

Sign In

Tehleel Mir 🐒
Tehleel Mir 🐒

26 Followers

Home

About

Pinned

Combination SumπŸ¦‚

Question Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from candidates an unlimited number of times…

Recursion

3 min read

Combination SumπŸ¦‚
Combination SumπŸ¦‚
Recursion

3 min read


Oct 15, 2022

Syntactical Introduction To Ruby language

This article is only for people who know at least one programming language, if you are not one of them, go to Mr. White to learn some chemistry. What you will learn from the below 1835 words? You will learn nothing, new in programming, but you will learn the syntax of the ruby language. …

Ruby On Rails

8 min read

Syntactical Introduction To Ruby language
Syntactical Introduction To Ruby language
Ruby On Rails

8 min read


Sep 21, 2022

How to add a sticky button/view in the bottom sheet dialog in android?

Well, you read the title so here is how to do it. Create a class that extends BottomSheetDialogFragment() to create a normal bottom sheet. Now in onCreateView() initialize your layout for the bottom sheet. Like below: BTW make sure to create your binding variable as global on the class…

Android

3 min read

How to add a sticky button/view in the bottom sheet dialog in android?
How to add a sticky button/view in the bottom sheet dialog in android?
Android

3 min read


Apr 16, 2022

Power of Two 🎐

Question Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2x. Example 1: Input: n = 1 Output: true Explanation: 20 = 1 Example 2: Input: n = 16 Output: true Explanation: 24 = 16 Example 3: Input: n = 3 Output: false Constraints: -231 <= n <= 231 - 1 Solution Time Complexity O(log n) Space Complexity O(log n)

Leetcode

1 min read

Power of Two 🎐
Power of Two 🎐
Leetcode

1 min read


Apr 16, 2022

Remove Linked List Elements 🧀

Question Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head. Example 1: Input: head = [1,2,6,3,4,5,6], val = 6 Output: [1,2,3,4,5] Example 2: Input: head = [], val = 1 Output: [] Example 3: Input: head = [7,7,7,7], val = 7 Output: [] Constraints: The number of nodes in the list is in the range [0, 104]. 1 <= Node.val <= 50

Leetcode

1 min read

Remove Linked List Elements 🧀
Remove Linked List Elements 🧀
Leetcode

1 min read


Apr 15, 2022

Pow(x, n) 🧢

Question Implement pow(x, n), which calculates x raised to the power n (i.e., xn). Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000 Example 2: Input: x = 2.10000, n = 3 Output: 9.26100 Example 3: Input: x = 2.00000, n = -2 Output: 0.25000 Explanation: 2-2 = 1/22 = 1/4 = 0.25 Constraints: -100.0 < x < 100.0 -231 <= n <= 231-1 -104 <= xn <= 104 Solution Time Complexity O(n) Space Complexity O(1)

Leetcode

1 min read

Pow(x, n) 🧢
Pow(x, n) 🧢
Leetcode

1 min read


Apr 13, 2022

Sort Colors 🐘

Question Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue. We will use the integers 0, 1, and 2 to represent the color red, white…

Leetcode

1 min read

Sort Colors 🐘
Sort Colors 🐘
Leetcode

1 min read


Apr 13, 2022

Set Matrix Zeroes 🐒

Question Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. You must do it in place. Example 1: Input: matrix = [[1,1,1],[1,0,1],[1,1,1]] Output: [[1,0,1],[0,0,0],[1,0,1]] Example 2:

Leetcode

1 min read

Set Matrix Zeroes 🐒
Set Matrix Zeroes 🐒
Leetcode

1 min read


Apr 12, 2022

Reverse Linked List πŸŒ‹

Question Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2:

Leetcode

1 min read

Reverse Linked List πŸŒ‹
Reverse Linked List πŸŒ‹
Leetcode

1 min read


Apr 12, 2022

3Sum πŸ‘ 

Question Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. Example 1: Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] Example 2: Input: nums = [] Output: [] Example 3: Input: nums = [0] Output: [] Constraints: 0 <= nums.length <= 3000

Leetcode

1 min read

3Sum πŸ‘ 
3Sum πŸ‘ 
Leetcode

1 min read

Tehleel Mir 🐒

Tehleel Mir 🐒

26 Followers

An droid

Following
  • Nick Wignall

    Nick Wignall

  • Renuka Gavrani

    Renuka Gavrani

  • Simona Stojanovic

    Simona Stojanovic

  • Shalini C

    Shalini C

  • Oleg Kagan

    Oleg Kagan

See all (8)

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Text to speech

Teams