Can you solve this real interview question? 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" + reverse(invert(Si - 1)) for i > 1 Where + denotes the con
Return the kth bit in Sn. It is guaranteed that k is valid for the given n. Example 1: Input: n = 3, k = 1 Output: "0" Explanation: S3 is "0111001". The 1st bit is "0". Example 2: Input: n = 4, k = 11 Output: "1" Explanation: S4 is "011100110110001". The 11th bi...
S2 = "011" S3 = "0111001" S4 = "011100110110001" ReturnthekthbitinSn. It is guaranteed thatkis valid for the givenn. Example 1: Input: n = 3, k = 1 Output: "0" Explanation: S3 is "0111001". The first bit is "0". Example 2: Input: n = 4, k = 11 Output: "1" Explana...
This was my accepted solution for this LeetCode problem: CREATEFUNCTIONgetNthHighestSalary(NINT)RETURNSINTBEGINDECLAREMINT;SETM=N-1;RETURN(#WRITEyour MySQL query statement below.SELECTDISTINCTSalaryFROMEmployeeORDERBYSalaryDESCLIMITM,1);END 2. Alternate Solution ...
* ListNode(int x) { * val = x; * next = null; * } * }*/publicclassSolution {publicListNode removeNthFromEnd(ListNode head,intn) { ListNode record=newListNode(0); record.next=head; ListNode node=record;for(inti=0;i<n;i++){if(head==null){returnnull; ...