Skip to content

Details

Are you preparing for an interview as a software engineer or similar role?

Tech companies ask questions about data structures and algorithms, Big O Analysis, and technical puzzles.

This is a series for individuals to prepare for such interviews.

  1. What will be covered as part of this series?

Different data structures(Array, List, Tree, Hash, Stack, Queue, Graph), sort & search algorithms, recursion, dynamic programming, graphs and more.

  1. How does it work?

We will first walk through the concepts around the topic in each session, followed by sample problem explanation and discussion, quiz, practice problems (home work) and prep work for next session.

  1. Is this meetup done in a specific coding language?

No, people from all coding language backgrounds are welcome.

  1. Is it just for people looking for a job then?

Well, no. It's for anyone interested in keeping their skills sharp, learn new ways of solving problems, and people looking for a new job in software development.

  1. What do I need to participate?

Laptop, paper, and pencil.

Please do take this survey to assess where you stand and share your preferences with us - https://forms.gle/6ghhZMf17tFXhTyr8

Agenda:

As part of the first session, we will be going over

  1. Introduction to this series
    2.Format of this study group and planned sessions
  2. Importance of time complexity analysis
  3. Big O, Omega, Theta notations
  4. Sample problem and analysing time complexity of its possible solutions
  5. Quiz
  6. Homework for session 1
  7. Prep work for session 2

Facilitators:

  1. Bharati Patidar
    (https://www.linkedin.com/in/bharati-patidar/)
    Data Scientist at Persistent Systems Limited

  2. Hussaina Begum
    (https://www.linkedin.com/in/nhussaina/)
    Staff Engineer at VMWare

  3. Gayle Ribeiro
    (https://www.linkedin.com/in/gayle-ribeiro-0388372/)
    Senior Member of Technical Staff at VMware

You may also like