Saturday, June 24, 2023

Sakshi's malpua recipe

 Take equal parts of maida, Mawa and milk make a flowing consistency batter.

.

Take a pan fry in ghee take a batter in spoon and pour slowly into the ghee and fry till it's light golden brown in colour.

.

Make chasni take sugar and water equal amount melt all the sugar and give just one boil only sticky texture then add some kesar and yellow food colour and dip the fried malpua into the chasni keep it till it's absorbed.

Tuesday, May 2, 2023

Elementary schools in Surrey

 1. Cornerstone montessori - 20th Jan open house

2. Pacific Academy

3. French school Gabrielle Roy

https://www.surreyschools.ca/page/1005/how-to-apply-online - 29th Jan apply
South Point - applications for KG closed

  •  Southridge ranked #1 with a rating of 10 -- applications for KG closed on 1st Dec
  •    Diamond ranked #1 with a rating of 10 -- crescent heights applied - to fill the form
  •    Iqra Islamic ranked #19 with a rating of 9.8
  •    Star Of The Sea ranked #27 with a rating of 9.5 - apply Jan 24th
  •    Khalsa (Surrey) ranked #35 with a rating of 9.2
  •    Chantrell Creek ranked #40 with a rating of 9.1
  •    Our Lady Of Good Counsel ranked #45 with a rating of 9.0
  •    Pacific Academy ranked #73 with a rating of 8.6 -- applied
  •    Cloverdale Catholic ranked #73 with a rating of 8.6 - to visit in person
  •    Semiahmoo Trail ranked #73 with a rating of 8.6
  •    Regent Christian ranked #121 with a rating of 7.9 - applied
  •    Dr. F D Sinclair ranked #121 with a rating of 7.9
  •    Cornerstone Montessori ranked #121 with a rating of 7.9 - call and book a tour
  •    Bayridge ranked #130 with a rating of 7.8
  •    Morgan ranked #141 with a rating of 7.7
  •    G.A.D ranked #141 with a rating of 7.7
  •    Laronde ranked #153 with a rating of 7.6
  •    White Rock Christian ranked #312 with a rating of 6.7

Word Wrap Question

 /*

We are building a word processor and we would like to implement a "word-wrap" functionality.

Given a list of words followed by a maximum number of characters in a line, return a collection of strings where each string element represents a line that contains as many words as possible, with the words in each line being concatenated with a single '-' (representing a space, but easier to see for testing). The length of each string must not exceed the maximum character length per line.

Your function should take in the maximum characters per line and return a data structure representing all lines in the indicated max length.

Examples:

words1 = [ "The", "day", "began", "as", "still", "as", "the",
          "night", "abruptly", "lighted", "with", "brilliant",
          "flame" ]

wrapLines(words1, 13) "wrap words1 to line length 13" =>

  [ "The-day-began",
    "as-still-as",
    "the-night",
    "abruptly",
    "lighted-with",
    "brilliant",
    "flame" ]

wrapLines(words1, 12) "wrap words1 to line length 12" =>

  [ "The-day",
    "began-as",
    "still-as-the",
    "night",
    "abruptly",
    "lighted-with",
    "brilliant",
    "flame" ]    


wrapLines(words1, 20) "wrap words1 to line length 20" =>

  [ "The-day-began-as",
    "still-as-the-night",
    "abruptly-lighted",
    "with-brilliant-flame" ]

words2 = [ "Hello" ]

wrapLines(words2, 5) "wrap words2 to line length 5" =>

  [ "Hello" ]


wrapLines(words2, 30) "wrap words2 to line length 30" =>

  [ "Hello" ]  

words3 = [ "Hello", "Hello" ]

wrapLines(words3, 5) "wrap words3 to line length 5" =>

  [ "Hello",
  "Hello" ]

words4 = ["Well", "Hello", "world" ]

wrapLines(words4, 5) "wrap words4 to line length 5" =>

  [ "Well",
  "Hello",
  "world" ]

words5 = ["Hello", "HelloWorld", "Hello", "Hello"]

wrapLines(words5, 20) "wrap words 5 to line length 20 =>

  [ "Hello-HelloWorld",
    "Hello-Hello" ]


words6 = [ "a", "b", "c", "d" ]
wrapLines(words6, 20) "wrap words 6 to line length 20 =>

  [ "a-b-c-d" ]

wrapLines(words6, 4) "wrap words 6 to line length 4 =>

  [ "a-b",
    "c-d" ]

wrapLines(words6, 1) "wrap words 6 to line length 1 =>

  [ "a",
    "b",
    "c",
    "d" ]

All Test Cases:
          words,  max line length
wrapLines(words1, 13)
wrapLines(words1, 12)
wrapLines(words1, 20)
wrapLines(words2, 5)
wrapLines(words2, 30)
wrapLines(words3, 5)
wrapLines(words4, 5)
wrapLines(words5, 20)
wrapLines(words6, 20)
wrapLines(words6, 4)
wrapLines(words6, 1)

n = number of words OR total characters
*/

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class Solution {
    static void Main(String[] args) {
        String[] words1 = new String[] {"The","day","began","as","still","as","the","night","abruptly","lighted","with","brilliant","flame"};
        String[] words2 = new String[] {"Hello"};
        String[] words3 = new String[] {"Hello""Hello"};
        String[] words4 = new String[] {"Well""Hello""world"};
        String[] words5 = new String[] {"Hello""HelloWorld""Hello""Hello"};
        String[] words6 = new String[] {"a""b""c""d"};
        printOutput(wrapLines(words1, 13));        
        printOutput(wrapLines(words1, 12));
        printOutput(wrapLines(words1, 20));
        printOutput(wrapLines(words2, 5));
        printOutput(wrapLines(words2, 30));
        printOutput(wrapLines(words3, 5));
        printOutput(wrapLines(words4, 5));
        printOutput(wrapLines(words5, 20));
        printOutput(wrapLines(words6, 20));
        printOutput(wrapLines(words6, 4));
        printOutput(wrapLines(words6, 1));
        
    }
    
    static void printOutput(String[] result)
    {
        for(int i= 0 ;i< result.Count(); i++) 
        {
            Console.WriteLine(result[i]);
        }
        Console.WriteLine();
    }
    
    static String[] wrapLines(String[] words, int expectedLength)
    {
        List<String> result = new List<String>();
        int count = 0;
        StringBuilder str = new StringBuilder();
       
        for(int i=0;i < words.Count(); i++)
        {            
            int lenOfEachWord = words[i].Count();
            if((count+lenOfEachWord) <= expectedLength)
            {
                str.Append(words[i]);
                str.Append("-");
                count += lenOfEachWord +1// 1 for hyphen
                //Console.WriteLine(count + " " + str.ToString());
            }
            else {
                    count = 0;
                    //Console.WriteLine(str.ToString());
                    result.Add(str.ToString().TrimEnd('-'));
                    str = new StringBuilder();
                    --i;
            }
        
        }
        result.Add(str.ToString().TrimEnd('-'));
        return result.ToArray();
    }
}

Friday, March 10, 2023

Banff Canada

 When you get to Banff, I would highly recommend that you go for easy but beautiful hikes at Johnston Canyon and Grassi Lakes near Canmore

Monday, February 27, 2023

Steps for Canada's visitor visa

 Steps for Canada visa:

  1. create an online application on IRCC website
  2. pay the fees (100+85), and schedule biometrics
  3. Get biometrics done and schedule passport stamping

PM role questions

 1. Design the world's best coffee machine

2. You're sitting next to the CEO of Indian Oil, he says that govt is planning to close down all the free-lefts in India. Should he be concerned? What's the impact on his business?

3. I want to start a startup in Home Automation area. What should I do? How should I go about it?

4. How do we solve the parking problem in hyderabad? Can we make something like airbnb for parking? that you can book parking slots? Design it completely, all features and prioritization etc


Banff Trip

https://parks.canada.ca/pn-np/ab/banff/visit/parkbus/louise  https://www.viator.com/tours/Canmore/Shuttle-Service-between-Lake-Louise-and-Mo...