Redirecting to
NADOS
- Largest Square Sub-matrix With All 1's
- Print All Paths With Minimum Jumps
- Print All Paths With Minimum Cost
- Print All Paths With Maximum Gold
- Print All Paths With Target Sum Subset
- Print All Results In 0-1 Knapsack
- 2 Key Keyboard
- 4 Key Keyboard
- Longest Increasing Subsequence
- Print All Longest Increasing Subsequences
- Maximum Sum Increasing Subsequence
- Longest Bitonic Subsequence
- Maximum Non-overlapping Bridges
- Russian Doll Envelopes
- Min Squares
- Catalan Number
- Number Of Bsts
- Count Of Valleys And Mountains
- Count Brackets
- Circle And Chords
- Number Of Ways Of Triangulation
- Catalan Numbers Variation
- Matrix Chain Multiplication
- Burst Balloons
- Minimum Score Of Triangulation
- Boolean Parenthesization
- Optimal Binary Search Tree
- Rod Cutting
- Minimum Palindromic Cut
- Longest Common Subsequence
- Longest Palindromic Subsequences
- Count Palindromic Subsequences
- Count Palindromic Substrings
- Longest Palindromic Substring
- Count Distinct Subsequences
- Count Of Distinct Palindromic Subsequences
- Wildcard Pattern Matching
- Regular Expression Matching
- Longest Common Substring
- Longest Repeating Subsequence
- Edit Distance
- Scramble String
- Minimum Ascii Delete Sum For Two Strings
- Minimum Cost To Make Two Strings Identical
- Kadane's Algorithm
- K Concatenation
- Maximum Sum Subarray With At Least K Elements
- Egg Drop
- Optimal Strategy For A Game
- Cherry Pickup
- Probability Of Knight In The Chessboard
- Highway Billboard
- Distinct Transformations
- Numeric Keypad
- Maximum Difference Of Zeros And Ones In Binary String
- Maximum Sum Of Two Non-overlapping Subarrays
- Maximum Sum Of Three Non-overlapping Subarrays
- Maximum Sum Of M Non-overlapping Subarrays
- Arithmetic Slices 1
- Arithmetic Slices 2
- Word Break
- Temple Offerings
- Minimum Insertions To Make Palindrome
- Ugly Number
- Super Ugly Number
- Find Water In Glass
- Frog Jump
- Interleaving Of Two Strings
- Maximum Length Of Repeated Subarray
- Distinct Echo Substrings
- Minimum Cost To Cut A Stick
- Delete And Earn
- Number Of Good Ways To Split A String
- Minimum Cost For Tickets
- Minimum Ascii Delete Sum For Two Strings
- Maximum Alternating Subsequence Sum
- Stone Game
- Largest Multiple Of Three
- Longest Increasing Subsequence
- Maximum Sum Increasing Subsequence
- Longest Bitonic Subsequence
- Temple Offerings
- Count Palindromic Substrings
- Minimum Score Of Triangulation
- Catalan Numbers Variation
- Print All Paths With Minimum Jumps
- Maximum Sum Of Two Non-overlapping Subarrays
- Arithmetic Slices - 2
- Longest Common Substring
- Count Brackets
- Minimum Cost To Make Two Strings Identical
- Number of Ways of Triangulation
- Russian Doll Envelopes
- Maximum Non - Overlapping Bridges
- Kadanes Algorithm
- Count Palindromic Subsequence
- Circle and Chords
- Optimal Strategy For a Game
- Maximum Sum of 3 Non-Overlapping Subarrays
- Print All Paths With Target Sum Subset
- Regular Expression Matching
- Number of BSTs
- Count of Valleys and Mountains
- Longest Palindromic Substrings
- Distinct Transformations
- Find Water In Glass
- Arithmetic Slices - 1
- Largest Square Sub Matrix with all 1s
- Maximum Length of Repeated Subarray
- All Repeating Except One
- Min Squares
- Numeric Keypad
- Word Break-2
- Minimum Palindromic Cuts
- Rod Cutting
- Burst Balloons
- Maximum Sum Of M Non-overlapping Subarrays
- Print All Longest Increasing Subsequences
- Longest Common Subsequence
- Count Distinct Subsequences
- Print All Paths With Minimum Counts
- Print all Paths with Maximum Gold
- Print All Results In 0-1 Knapsack
- Wildcard Pattern Matching
- Catalan Numbers
- Boolean Parenthesization
- Optimal Binary Search Tree
- Longest Repeating Subsequence
- Minimum Ascii Delete Sum for Two Strings
- Edit Distance
- K Concatenation
- Maximum Sum Subarray With At Least K Elements
- Egg Drop
- Scramble String
- Highway Billboard
- Minimum Insertions To Make Palindrome
- Ugly Number
- Super Ugly Number
- Frog Jump
- Interleaving of two strings
2 Key Keyboard
1. You are given a number N.Input Format
2. You have to print exactly N number of 'X' on a notepad by performing the minimum number of operations.
3. Operations allowed are -
copyAll -> You can copy all the characters present on the notepad.
Paste -> You can paste the last copied characters.
4. You have to find the minimum number of operations to get N 'X'.
Note -> Initially, one 'X' is present on the screen.
A numberOutput Format
Check the sample output and question video.Question Video Constraints
1 <= N <= 1000Sample Input
3Sample Output
3
-
Asked in Companies
-
Related Topics
Your profile is incomplete!
Please click here to complete your profile to continue submitting questions.
Video Solution
Code Solution
{ }
Editor Settings
Font Size
Key Binding
Keyboard Shortcut
- fold Alt-L|Ctrl-F1
- unfold Alt-Shift-L|Ctrl-Shift-F1
- Gotoend Ctrl-End
- Gotostart Ctrl-Home
- Movelinesup Alt-Up
- Movelinesdown Alt-Down
- Undo Ctrl-Z
- Redo Ctrl-Shift-Z|Ctrl-Y
- Replace Ctrl-H
- Togglecomment Ctrl-/
- ToggleBlockComment Ctrl-Shift-/
- Removeline Ctrl-D
{ }
Run
Editor Settings
Font Size
Key Binding
Keyboard Shortcut
- fold Alt-L|Ctrl-F1
- unfold Alt-Shift-L|Ctrl-Shift-F1
- Gotoend Ctrl-End
- Gotostart Ctrl-Home
- Movelinesup Alt-Up
- Movelinesdown Alt-Down
- Undo Ctrl-Z
- Redo Ctrl-Shift-Z|Ctrl-Y
- Replace Ctrl-H
- Togglecomment Ctrl-/
- ToggleBlockComment Ctrl-Shift-/
- Removeline Ctrl-D
