berabulut

// O(n)
func topKFrequent(nums []int, k int) []int {
	if len(nums) < k {
		return nums
	}

	frequency := make(map[int]int)
	sortedBucket := make([][]int, len(nums)+1)

	for _, v := range nums {

berabulut

// O(m*n*26)-> O(m*n)
func groupAnagrams(strs []string) [][]string {
    anagramMap := make(map[string][]string)
    
    // n
    for _, str := range strs { 
        keyCount := make([]int, 26)
         
        // length of average string, m
        for _, r := range str {