SWE Prep

Home
Archive
About
NewTop
Throughout my four years learning and experiencing Computer Science, I learned a lot of lessons along the way. From writing my first “Hello World…
Sameer Khoja
2
Lessons learned: recursion, memoization
Sameer Khoja
2
Lessons Learned: Arrays, binary search, recursion
Sameer Khoja
1
Lesson: Array Manipulation
Sameer Khoja
Lessons Learned: Binary trees, recursion, error values
Sameer Khoja
1
Question: Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary…
Sameer Khoja
Lessons Learned: recursion, tree traversal
Sameer Khoja
1
Lessons Learned: Binary Search Tree, recursion
Sameer Khoja
1
Lessons Learned: stacks, sorting
Sameer Khoja
Time complexity
Sameer Khoja
1
Question 8: T1 and T2 are two very large binary trees, with T1 much bigger than T2. Create an algorithm to determine if T2 is a subtree of T1. One way…
Sameer Khoja
1
Question: Given a string containing just the characters ’(’, ’)’, ’’, ’’, ’[’ and ’]’, determine if the input string is valid.
Sameer Khoja
© 2022 Sameer Khoja
Privacy ∙ Terms ∙ Collection notice
Publish on Substack Get the app
Substack is the home for great writing