fixing comments

Author: Shahzod Shafizod

challenge-1/submissions/shahzodshafizod/solution-template_test.go

@@ -2,7 +2,6 @@ package main
 
 import (
 	"fmt"
-	"sort"
 	"sync"
 )
 
@@ -20,66 +19,49 @@ type Manager struct {
 }
 
 // AddEmployee adds a new employee to the manager's list.
-func (m *Manager) AddEmployee(e Employee) { // Time: O(n)
+func (m *Manager) AddEmployee(e Employee) { // O(1) or O(n)
 	m.mu.Lock()
 	defer m.mu.Unlock()
-	// sort.Slice(m.Employees, func(i, j int) bool {
-	// 	return m.Employees[i].ID < m.Employees[j].ID
-	// })
-	idx := m.search(e.ID)
-	if idx == -1 {
-		idx = len(m.Employees)
-	}
-	m.Employees = append(m.Employees, Employee{})
-	copy(m.Employees[idx+1:], m.Employees[idx:])
-	m.Employees[idx] = e
+	m.Employees = append(m.Employees, e) // O(1) or O(n)
 	m.totalSalary += e.Salary
 }
 
 // RemoveEmployee removes an employee by ID from the manager's list.
-func (m *Manager) RemoveEmployee(id int) bool { // Time: O(n)
+func (m *Manager) RemoveEmployee(id int) bool { // O(n)
 	m.mu.Lock()
 	defer m.mu.Unlock()
-	index := m.search(id) // O(log n)
-	if index != -1 {
-		m.totalSalary -= m.Employees[index].Salary
-		m.Employees = append(m.Employees[:index], m.Employees[index+1:]...) // O(n)
-		return true
+	for index := range m.Employees {
+		if m.Employees[index].ID == id {
+			m.totalSalary -= m.Employees[index].Salary
+			m.Employees = append(m.Employees[:index], m.Employees[index+1:]...)
+			return true
+		}
 	}
 	return false
 }
 
 // GetAverageSalary calculates the average salary of all employees.
-func (m *Manager) GetAverageSalary() float64 { // Time: O(1)
+func (m *Manager) GetAverageSalary() float64 { // O(1)
 	m.mu.RLock()
 	defer m.mu.RUnlock()
-	if n := len(m.Employees); n > 0 {
-		return m.totalSalary / float64(n)
+	if len(m.Employees) == 0 {
+		return 0
 	}
-	return 0
+	return m.totalSalary / float64(len(m.Employees))
 }
 
 // FindEmployeeByID finds and returns an employee by their ID.
-func (m *Manager) FindEmployeeByID(id int) *Employee { // Time: O(log n)
+func (m *Manager) FindEmployeeByID(id int) *Employee { // O(n)
 	m.mu.RLock()
 	defer m.mu.RUnlock()
-	index := m.search(id)
-	if index != -1 {
-		return &m.Employees[index]
+	for index := range m.Employees {
+		if m.Employees[index].ID == id {
+			return &m.Employees[index]
+		}
 	}
 	return nil
 }
 
-func (m *Manager) search(id int) int { // Time: O(log n)
-	index := sort.Search(len(m.Employees), func(i int) bool {
-		return m.Employees[i].ID >= id
-	}) // sort.Search returns an index where a new item could be inserted, so we do not receive -1 or an error
-	if index < len(m.Employees) && m.Employees[index].ID == id {
-		return index
-	}
-	return -1
-}
-
 func main() {
 	manager := Manager{}
 	manager.AddEmployee(Employee{ID: 1, Name: "Alice", Age: 30, Salary: 70000})

challenge-2/submissions/shahzodshafizod/solution-template_test.go

@@ -13,8 +13,6 @@ import (
 // Return a map from the query (starting node) to the BFS order as a slice of nodes.
 // YOU MUST use concurrency (goroutines + channels) to pass the performance tests.
 func ConcurrentBFSQueries(graph map[int][]int, queries []int, numWorkers int) map[int][]int {
-	// TODO: Implement concurrency-based BFS for multiple queries.
-	// Return an empty map so the code compiles but fails tests if unchanged.
 	if numWorkers <= 0 {
 		return map[int][]int{}
 	}