// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// convert
//
// 6. Zigzag Conversion
//
// The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
//

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
import (
    "strings"
)
 
// reverseWords
//
// 151. Reverse Words in a String

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// longestCommonPrefix
//
// 14. Longest Common Prefix
//
// Write a function to find the longest common prefix string amongst an array of strings.
//
// If there is no common prefix, return an empty string "".
//

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// lengthOfLastWord
//
// 58. Length of Last Word
// Given a string s consisting of words and spaces, return the length of the last word in the string.
//
// A word is a maximal
// substring
//
//  consisting of non-space characters only.
//
// Example 1:

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
import (
    "bytes"
 
// intToRoman
//
// 12. Integer to Roman
//
// Seven different symbols represent Roman numerals with the following values:
//
// Symbol      Value
// I     1
// V     5
// X

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// romanToInt
//
// 13. Roman to Integer
//
// Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
//
// Symbol       Value
// I             1
// V             5
// X             10

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// candy
//
// 135. Candy
// There are n children standing

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// productExceptSelf
//
// 238. Product of Array Except Self
// Medium
// Topics
// Companies
// Hint
// Given

type RandomizedSet interface {
 // Insert Добавляет элемент к списку уникальных элементов
 // в случае успеха возвращает ИСТИНУ
 // в обратном случае ЛОЖЬ
 Insert(val int) bool
 // Remove Удаляет элемент из списка уникальных

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
import (
    "sort"
)
 
// hIndex
//
// 274. H-Index
//
// Given an array of integers citations where citations[i] is the number of citations a researcher received

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// jump
//

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// canJump
//
// 55. Jump Game
// You are given an integer array nums. You are initially positioned at the array's

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// maxProfitII
// 
// 122. Best Time to Buy and Sell Stock II
// 
// You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
// 
// On each day,

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// maxProfit
//
// 121. Best Time to Buy and Sell Stock
// You are given an array prices where prices[i] is the price of a given stock on the ith day.
//
// You want to maximize your profit

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// rotate
//
// 189. Rotate Array
//
// Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.
//
// Example 1:
//
// Input: nums = [1,2,3,4,5,6,7], k = 3
// Output: [5,6,7,1,2,3,4]

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// majorityElement
//
// 169. Majority Element
// Given an array nums of size n, return the majority element.
//
// The majority element is the element that appears

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// removeDuplicates
//
// 80. Remove Duplicates from Sorted Array II
// Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// removeDuplicates
//
// 26. Remove Duplicates from Sorted Array
// Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// removeElement
// 27. Remove element
// Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.
//
// Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following

package topInterview
 
// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
// merge problem
//
// 88. Merge Sorted Array
//
// You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n,
// representing the number of elements in nums1 and nums2 respectively.
//
// Merge nums1 and nums2 into a single array sorted in non-decreasing order.
// The final sorted array should

package main
 
import "fmt"
 
func main() {
    n := 625
    fmt.Println(n, "is square:", isSquare(n))
}
 
func isSquare(number int) bool {
    if number < 1 {
        return false
    }
    var sum int
    for i := 0; sum < number; i++ {
        sum += i<<1 + 1
        if sum == number {
            return true
        }
    }
    return false
}

package cube
 
import "fmt"
 
type Side struct {
    Value

package narayana
 
func Next(sl []int) bool {
 
    var (
        n1      int
        n2      int
        n1Found bool
    )
 
    for i := len(sl) - 2; i >= 0; i-- {
        if sl[i] < sl[i+1] {
            n1 = i
            n1Found = true
            break
        }
    }
 
    if !n1Found {
        return false
    }
 
    for i := len(sl) - 1; i > 0; i-- {
        if sl[i] > sl[n1] {
            n2 = i
            break

package main
 
import (
    "fmt"
    "math/rand"
    "time"
)
 
func main() {
    c, r := 10, 100
    arr := ArrayOfRandomInt(c, r)
    fmt.Println(arr)
    fmt.Println(BubbleSort(arr))
 
}
 
func BubbleSort(arr []int) []int {
    var iCount int
    for l, found := len(arr)-1, false; l > 1; l-- {
        found = false
        for i := 0; i < l; i++ {
            iCount++

package main
 
import "fmt"
 
func main() {
    fmt.Println(DigitsArray(139))
}
 
func DigitsArray(n int) (res []int) {
    for n > 0 {
        res = append([]int{n % 10}, res...)
        n /= 10
    }
    return
}