ragni1,Rageeni Sah,github

Name: Rageeni Sah

Type: User

Company: https://www.oracle.com/in/index.html

Bio: Bachelor in Engineering (E&C) with 2+ Years of Experience in Analytic and Industrial experience on ML projects using Decision trees, RF, ANN, CNN & clusters.

Location: Bangalore

Rageeni Sah's Projects

queen-s-position

This is python code to find all moves that a queen can take from position (p,q) on a chess board.

Steve has a string, , consisting of lowercase English alphabetic letters. In one operation, he can delete any pair of adjacent letters with same value. For example, string "aabcc" would become either "aab" or "bcc" after operation. Steve wants to reduce as much as possible. To do this, he will repeat the above operation as many times as it can be performed. Help Steve out by finding and printing 's non-reducible form! Note: If the final string is empty, print Empty String . Input Format A single string, . Constraints Output Format If the final string is empty, print Empty String; otherwise, print the final non-reducible string. Sample Input 0 aaabccddd Sample Output 0 abd Sample Case 0 Steve can perform the following sequence of operations to get the final string: aaabccddd → abccddd abccddd → abddd abddd → abd Thus, we print abd. Sample Input 1 baab Sample Output 1 Empty String Explanation 1 Steve can perform the following sequence of operations to get the final string: baab → bb bb → Empty String Thus, we print Empty String. Sample Input 2 aa Sample Output 2 Empty String

Recommend Projects