vrat28

var a = 1
var b = 2

print("Before swap: \(a) , \(b)")

// swapping
let temp = a
a = b
b = temp

vrat28

int x, y;  
printf("before swapping numbers: %d   %d\n",x,y);  
/*swapping*/  
x = x + y - (y = x)
printf("before swapping numbers: %d   %d\n",x,y); 

vrat28

x = 5
y = 10

x, y = y, x
print("x =", x)
print("y =", y)

vrat28

func swap<T:Comparable>(_ a:inout T, _ b :inout T) {
    (a,b) = (b,a)
}

var a = 1
var b = 2

swap(&a,&b)

print(a)

vrat28

class BalancedBrackets {
    func checkBalancedBrackets(string: String) -> Bool {
        var stack = [Character]()
        let mapBrackets : [Character: Character] = ["}":"{", ")":"(", "]":"["]
        let openingBrackets = "([{"
        for char in string {
            if openingBrackets.contains(char){
                stack.append(char)
            }
            else {

vrat28

 func findMajorityElement(_ input:[Int]) -> Int{
    var frequencyMap = [Int:Int]()
    for num in input {
        if let count =  frequencyMap[num] {
            frequencyMap[num] = count + 1
        }
        else {
            frequencyMap[num] = 1
        }
    }

vrat28

// Using Boyer-Moore voting algorithm
func findMajorityElement(_ input:[Int]) -> Int {
    var maxElement = 0
    var count = 0
    
    // Iteration 1 : find max frequency element
    for num in input {
        if num == maxElement {
            count += 1
        }

vrat28

var stack = [Character]()
let mapBrackets : [Character: Character] = ["}":"{", ")":"(", "]":"["]
let openingBrackets = "([{"

vrat28

for char in string { 
  if openingBrackets.contains(char){
      stack.append(char)
     }
 }

vrat28

if let last = stack.last, last == mapBrackets[char] {
      stack.popLast()
}