1545. Find Kth Bit in Nth Binary String
Given two positive integers n and k, the binary string Sn is formed as follows: S1 = “0” Si = Si – 1 + “1” […]
2044. Count Number of Maximum Bitwise-OR Subsets
Given an integer array nums, find the maximum possible bitwise OR of a subset of nums and return the number of different non-empty subsets with the maximum bitwise OR. An
Nearest multiple of 10 Microsoft
A string str is given to represent a positive number. The task is to round str to the nearest multiple of 10.
Single Number
Given an array arr[] of positive integers where every element appears even times except for one. Find that number occurring an odd
Split the Array
Given an array arr[] of integers, the task is to count the number of ways to split given array elements into two
1106. Parsing A Boolean Expression
A boolean expression is an expression that evaluates to either true or false. It can be in one of the following shapes: ‘t’ that evaluates to true.
Sort a k sorted doubly linked list
Given a doubly linked list, each node is at most k-indices away from its target position. The problem is to
670. Maximum Swap
You are given an integer num. You can swap two digits at most once to get the maximum valued number. Return the
Split Linked List Alternatingly
Given a singly linked list’s head. Your task is to complete the function alternatingSplitList() that splits the given linked list into two smaller lists.
1405. Longest Happy String
A string s is called happy if it satisfies the following conditions: s only contains the letters ‘a’, ‘b’, and ‘c’. s does not contain any of “aaa”, “bbb”, or “ccc” as a
2938. Separate Black and White Balls
There are n balls on a table, each ball has a color black or white. You are given a 0-indexed binary string s of length n, where 1 and 0 represent