SWE Prep

NewTop
Lessons learned: recursion, memoization
Share
Throughout my four years learning and experiencing Computer Science, I learned a lot of lessons along the way. From writing my first “Hello World…
Share
Lessons Learned: Arrays, binary search, recursion
Comment
Share
Lesson: Array Manipulation
Share
Lessons Learned: Binary trees, recursion, error values
Comment
Share
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…
Share
Lessons Learned: Binary Search Tree, recursion
Share
Lessons Learned: recursion, tree traversal
Share
Lessons Learned: stacks, sorting
Share
Time complexity
Share
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…
Share
Question: Given a string containing just the characters ’(’, ’)’, ’’, ’’, ’[’ and ’]’, determine if the input string is valid. 
Share
© 2022 Sameer Khoja
Privacy ∙ Terms ∙ Collection notice
Publish on Substack Get the app
Substack is the home for great writing